An almost cubic lower bound for depth three arithmetic circuits
From MaRDI portal
Recommendations
Cited in
(18)- Multi-k-ic depth three circuit lower bound
- Limitations of sums of bounded read formulas and ABPs
- Improved bounds on the an-complexity of \(O(1)\)-linear functions
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
- A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle
- A lower bound for depth-3 circuits with MOD m gates
- Multi-\(k\)-ic depth three circuit lower bound
- A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
- “Resistant” Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
- Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem
- scientific article; zbMATH DE number 1775446 (Why is no real title available?)
- On the power of border of depth-3 arithmetic circuits
- On the Symmetries of and Equivalence Test for Design Polynomials.
- A super-quadratic lower bound for depth four arithmetic circuits
- scientific article; zbMATH DE number 7250151 (Why is no real title available?)
- Lower bounds for set-multilinear branching programs
- Superpolynomial lower bounds against low-depth algebraic circuits
- Improved lower bound, and proof barrier, for constant depth algebraic circuits
This page was built for publication: An almost cubic lower bound for depth three arithmetic circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598169)
