Recent progress on arithmetic circuit lower bounds
From MaRDI portal
Recommendations
- Arithmetic circuits: a survey of recent results and open questions
- The computational power of depth five arithmetic circuits
- Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits
- The limits of depth reduction for arithmetic formulas: it's all about the top fan-in
- On the power of homogeneous depth 4 arithmetic circuits
Cited in
(11)- A lower bound on determinantal complexity
- On Lower Bounds for Constant Width Arithmetic Circuits
- On defining integers and proving arithmetic circuit lower bounds
- Determinants vs. algebraic branching programs
- Factorization of polynomials given by arithmetic branching programs
- Depth-4 lower bounds, determinantal complexity: a unified approach
- Arithmetic circuits: a survey of recent results and open questions
- A quadratic lower bound for algebraic branching programs
- Lower bounds for special cases of syntactic multilinear ABPs
- Quadratic lower bounds for algebraic branching programs and formulas
- A quadratic lower bound for homogeneous algebraic branching programs
This page was built for publication: Recent progress on arithmetic circuit lower bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4967171)
