The computational power of depth five arithmetic circuits
From MaRDI portal
Recommendations
- Finer separations between shallow arithmetic circuits
- Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits
- scientific article; zbMATH DE number 7204282
- On the power of homogeneous depth 4 arithmetic circuits
- Lower bounds for depth-three arithmetic circuits with small bottom fanin
Cites work
- scientific article; zbMATH DE number 1775446 (Why is no real title available?)
- scientific article; zbMATH DE number 7204282 (Why is no real title available?)
- A Lower Bound for the Formula Size of Rational Functions
- A depth-five lower bound for iterated matrix multiplication
- A super-polynomial lower bound for regular arithmetic formulas
- An exponential lower bound for homogeneous depth four arithmetic formulas
- Approaching the chasm at depth four
- Arithmetic circuits: a chasm at depth 3
- Arithmetic circuits: the chasm at depth four gets wider
- Depth-4 lower bounds, determinantal complexity: a unified approach
- Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields.
- Fast Parallel Computation of Polynomials Using Few Processors
- Finer separations between shallow arithmetic circuits
- Improved bounds for reduction to depth 4 and depth 3
- Lower bounds for depth 4 formulas computing iterated matrix multiplication
- Lower bounds for depth three arithmetic circuits with small bottom fanin
- Lower bounds on arithmetic circuits via partial derivatives
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits
- On the Parallel Evaluation of Multivariate Polynomials
- On the limits of depth reduction at depth 3 over small finite fields
- On the power of homogeneous depth 4 arithmetic circuits
- Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas
- Tensor-rank and lower bounds for arithmetic formulas
- The limits of depth reduction for arithmetic formulas
Cited in
(14)- On the power of homogeneous depth 4 arithmetic circuits
- Arithmetic circuits with locally low algebraic rank
- Lower bounds for depth-three arithmetic circuits with small bottom fanin
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
- scientific article; zbMATH DE number 7204282 (Why is no real title available?)
- Finer separations between shallow arithmetic circuits
- Improved bounds for reduction to depth 4 and depth 3
- On \(\varSigma\wedge\varSigma\wedge\varSigma\) circuits: the role of middle \(\varSigma\) fan-in, homogeneity and bottom degree
- Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits
- Lower bounds for depth three arithmetic circuits with small bottom fanin
- The limits of depth reduction for arithmetic formulas: it's all about the top fan-in
- Superpolynomial lower bounds against low-depth algebraic circuits
- Elusive functions and lower bounds for arithmetic circuits
- Recent progress on arithmetic circuit lower bounds
This page was built for publication: The computational power of depth five arithmetic circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629389)
