The Computational Power of Depth Five Arithmetic Circuits
From MaRDI portal
Publication:4629389
DOI10.1137/18M1173319zbMath1417.68056OpenAlexW2917030467MaRDI QIDQ4629389
Mrinal Kumar, Ramprasad Saptharishi
Publication date: 22 March 2019
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/18m1173319
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Uses Software
Cites Work
- Arithmetic circuits: the chasm at depth four gets wider
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Lower bounds on arithmetic circuits via partial derivatives
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits
- Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields.
- Improved bounds for reduction to depth 4 and depth 3
- Arithmetic Circuits: A Chasm at Depth 3
- Tensor-rank and lower bounds for arithmetic formulas
- On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields
- Depth-4 Lower Bounds, Determinantal Complexity : A Unified Approach
- An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas
- On the Power of Homogeneous Depth 4 Arithmetic Circuits
- Fast Parallel Computation of Polynomials Using Few Processors
- A Lower Bound for the Formula Size of Rational Functions
- On the Parallel Evaluation of Multivariate Polynomials
- Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas
- Lower bounds for depth 4 formulas computing iterated matrix multiplication
- The limits of depth reduction for arithmetic formulas
- A super-polynomial lower bound for regular arithmetic formulas
- Approaching the Chasm at Depth Four
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The Computational Power of Depth Five Arithmetic Circuits
