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
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
Proceedings of the forty-second ACM symposium on Theory of computing
Tensor-rank and lower bounds for arithmetic formulas
Proceedings of the forty-second ACM symposium on Theory of computing
Non-commutative circuits and the sum-of-squares problem
Proceedings of the forty-second ACM symposium on Theory of computing
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
Recent results on polynomial identity testing
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Separating multilinear branching programs and formulas
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
Arithmetic circuit lower bounds via maxrank
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Tensor-Rank and Lower Bounds for Arithmetic Formulas
Journal of the ACM (JACM)
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits
Computational Complexity
Hi-index | 0.00 |
We construct an explicit polynomial $f(x_1,\dots,x_n)$, with coefficients in $\{0,1\}$, such that the size of any syntactically multilinear arithmetic circuit computing $f$ is at least $\Omega(n^{4/3}/\log^2n)$. The lower bound holds over any field.