An exponential lower bound for depth 3 arithmetic circuits
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Depth-3 arithmetic circuits over fields of characteristic zero
Computational Complexity
Lower bounds on arithmetic circuits via partial derivatives
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Affine Projections of Symmetric Polynomials
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Lower Bounds and Separations for Constant Depth Multilinear Circuits
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Diagonal Circuit Identity Testing and Lower Bounds
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
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)
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
SIAM Journal on Computing
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Separating multilinear branching programs and formulas
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Arithmetic circuits: The chasm at depth four gets wider
Theoretical Computer Science
Hi-index | 0.00 |
We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against several classes of non-multilinear arithmetic circuits. In particular, we obtain the following results : · As our first main result, we prove that any homogeneous depth-3 circuit for computing the product of d matrices of dimension n ×n requires Ω(nd−1/2d) size. This improves the lower bounds in [9] for d=ω(1). · As our second main result, we show that there is an explicit polynomial on n variables and degree at most $\frac{n}{2}$ for which any depth-3 circuit C of product dimension at most $\frac{n}{10}$ (dimension of the space of affine forms feeding into each product gate) requires size 2Ω(n). This generalizes the lower bounds against diagonal circuits proved in [14]. Diagonal circuits are of product dimension 1. · We prove a nΩ(logn) lower bound on the size of product-sparse formulas. By definition, any multilinear formula is a product-sparse formula. Thus, this result extends the known super-polynomial lower bounds on the size of multilinear formulas [11]. · We prove a 2Ω(n) lower bound on the size of partitioned arithmetic branching programs. This result extends the known exponential lower bound on the size of ordered arithmetic branching programs [7].