Finding irreducible polynomials over finite fields
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Journal of Algorithms
An exponential lower bound for depth 3 arithmetic circuits
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Learning functions represented as multiplicity automata
Journal of the ACM (JACM)
Randomness efficient identity testing of multivariate polynomials
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Testing polynomials which are easy to compute (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Deterministic polynomial identity testing in non-commutative models
Computational Complexity
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
Elusive functions and lower bounds for arithmetic circuits
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Arithmetic Circuits: A Chasm at Depth Four
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Multi-linear formulas for permanent and determinant are of super-polynomial size
Journal of the ACM (JACM)
Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Improved Polynomial Identity Testing for Read-Once Formulas
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
SIAM Journal on Computing
Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates
SIAM Journal on Computing
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
Proceedings of the forty-second ACM symposium on Theory of computing
New Results on Noncommutative and Commutative Polynomial Identity Testing
Computational Complexity
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
Black-box identity testing of depth-4 multilinear circuits
Proceedings of the forty-third annual ACM symposium on Theory of computing
Efficient Reconstruction of Random Multilinear Formulas
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Proving lower bounds via pseudo-random generators
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Hi-index | 0.00 |
We present a randomized algorithm for reconstructing multilinear ΣΠΣΠ(2) circuits, i.e., multilinear depth-4 circuits with fan-in 2 at the top + gate. The algorithm is given blackbox access to a polynomial f ∈ F[x1,...,xn] computable by a multilinear ΣΠΣΠ(2) circuit of size s and outputs an equivalent multilinear ΣΠΣΠ(2) circuit, runs in time poly(n,s), and works over any field F. This is the first reconstruction result for any model of depth-4 arithmetic circuits. Prior to our work, reconstruction results for bounded depth circuits were known only for depth-2 arithmetic circuits (Klivans & Spielman, STOC 2001), ΣΠΣ(2) circuits (depth-3 arithmetic circuits with top fan-in 2) (Shpilka, STOC 2007), and ΣΠΣ(k) with k=O(1) (Karnin & Shpilka, CCC 2009). Moreover, the running times of these algorithms have a polynomial dependence on |F| and hence do not work for infinite fields such as Q. Our techniques are quite different from the previous ones for depth-3 reconstruction and rely on a polynomial operator introduced by Karnin et al. (STOC 2010) and Saraf & Volkovich (STOC 2011) for devising blackbox identity tests for multilinear ΣΠΣΠ(k) circuits. Some other ingredients of our algorithm include the classical multivariate blackbox factoring algorithm by Kaltofen & Trager (FOCS 1988) and an average-case algorithm for reconstructing ΣΠΣ(2) circuits by Kayal.