Improved Bounds for Reduction to Depth 4 and Depth 3
Author:
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 813-824
Abstract
No abstract availableKeywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Arithmetic Circuits: A Chasm at Depth Three2013
- Approaching the Chasm at Depth Four2013
- Arithmetic circuits: The chasm at depth four gets widerTheoretical Computer Science, 2012
- Arithmetic Circuits: A Survey of Recent Results and Open QuestionsFoundations and Trends® in Theoretical Computer Science, 2010
- Arithmetic Circuits: A Chasm at Depth Four2008
- Completeness and Reduction in Algebraic Complexity Theory2000
- Non-commutative arithmetic circuits: depth reduction and size lower boundsTheoretical Computer Science, 1998
- Feasible arithmetic computations: Valiant's hypothesisJournal of Symbolic Computation, 1987
- Fast Parallel Computation of Polynomials Using Few ProcessorsSIAM Journal on Computing, 1983