Name
Abstract | ||
|---|---|---|
In [8], Kaltofen proved the remarkable fact that multivariate polynomial factorization can be done efficiently, in randomized polynomial time. Still, more than twenty years after Kaltofen's work, many questions remain unanswered regarding the complexity aspects of polynomial factorization, such as the question of whether factors of polynomials efficiently computed by arithmetic formulas also have small arithmetic formulas, asked in [10], and the question of bounding the depth of the circuits computing the factors of a polynomial. We are able to answer these questions in the affirmative for the interesting class of polynomials of bounded individual degrees, which contains polynomials such as the determinant and the permanent. We show that if P(x1,..., xn) is a polynomial with individual degrees bounded by r that can be computed by a formula of size s and depth d, then any factor f(x1,..., xn) of P (x1,..., xn) can be computed by a formula of size poly((rn)r, s) and depth d+5. This partially answers the question above posed in [10], that asked if this result holds without the exponential dependence on r. Our work generalizes the main factorization theorem from Dvir et al. [2], who proved it for the special case when the factors are of the form f(x1,..., xn) ≡ xn ---g(x1,..., xn−1). Along the way, we introduce several new technical ideas that could be of independent interest when studying arithmetic circuits (or formulas). |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s00037-016-0130-2 | Computational Complexity |
Keywords | DocType | Volume |
Arithmetic circuits, Factoring, Algebraic complexity, 68Q05, 68Q15, 68Q17 | Journal | 25 |
Issue | ISSN | Citations |
2 | 1420-8954 | 2 |
PageRank | References | Authors |
0.35 | 12 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rafael Mendes de Oliveira | 1 | 49 | 7.59 |