Factorization of Polynomials Given by Arithmetic Branching Programs
Keyword(s):
AbstractGiven a multivariate polynomial computed by an arithmetic branching program (ABP) of size s, we show that all its factors can be computed by arithmetic branching programs of size poly(s). Kaltofen gave a similar result for polynomials computed by arithmetic circuits. The previously known best upper bound for ABP-factors was poly $$ (s^{ {\rm \log} s}) $$ ( s log s ) .
2018 ◽
Vol 27
(3)
◽
pp. 310-333
◽
2016 ◽
Vol E99.A
(1)
◽
pp. 185-195
2019 ◽
Vol 71
(3)
◽
pp. 1005-1026
◽
Keyword(s):