Matching is as easy as matrix inversion
Combinatorica
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Non-commutative arithmetic circuits: depth reduction and size lower bounds
Theoretical Computer Science
Fast Probabilistic Algorithms for Verification of Polynomial Identities
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
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Combinatorics, Probability and Computing
Multi-linear formulas for permanent and determinant are of super-polynomial size
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Multilinear- NC" " Multilinear- NC"
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Deterministic polynomial identity testing in non-commutative models
Computational Complexity
Polynomial Identity Testing for Depth 3 Circuits
Computational Complexity
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
SIAM Journal on Computing
Read-once polynomial identity testing
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Lower Bounds and Separations for Constant Depth Multilinear Circuits
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
IP=PSPACE (interactive proof=polynomial space)
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Diagonal Circuit Identity Testing and Lower Bounds
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Arithmetic Circuits: A Chasm at Depth Four
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
An Almost Optimal Rank Bound for Depth-3 Identities
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
SIAM Journal on Computing
The monomial ideal membership problem and polynomial identity testing
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Proving lower bounds via pseudo-random generators
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On the relation between polynomial identity testing and finding variable disjoint factors
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
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
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter
Proceedings of the forty-third annual ACM symposium on Theory of computing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Reconstruction of depth-4 multilinear circuits with top fan-in 2
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation
Theory of Computing Systems
Hi-index | 0.00 |
We give the first sub-exponential time deterministic polynomial identity testing algorithm for depth-4 multilinear circuits with a small top fan-in. More accurately, our algorithm works for depth-4 circuits with a plus gate at the top (also known as ΣΠΣΠ circuits) and has a running time of exp(poly(log(n),log(s),k)) where n is the number of variables, s is the size of the circuit and k is the fan-in of the top gate. In particular, when the circuit is of polynomial (or quasi-polynomial) size, our algorithm runs in quasi-polynomial time. In [AV08], it was shown that derandomizing polynomial identity testing for general ΣΠΣΠ circuits implies a derandomization of polynomial identity testing in general arithmetic circuits. Prior to this work sub-exponential time deterministic algorithms were known for depth-$3$ circuits with small top fan-in and for very restricted versions of depth-4 circuits. The main ingredient in our proof is a new structural theorem for multilinear ΣΠΣΠ(k) circuits. Roughly, this theorem shows that any nonzero multilinear ΣΠΣΠ(k) circuit contains an `embedded' nonzero multilinear ΣΠΣ(k) circuit. Using ideas from previous works on identity testing of sums of read-once formulas and of depth-3 multilinear circuits, we are able to exploit this structure and obtain an identity testing algorithm for multilinear ΣΠΣΠ(k) circuits.