Improved bounds for reduction to depth 4 and depth 3
Author:
- Sébastien TavenasSTSébastien Tavenas
- 1 February 2015
- journal article
- Published by Elsevier in Information and Computation
- Vol. 240, 2-11
Abstract
No abstract availableAll Related Versions
This publication has 7 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
- Characterizing Valiant's algebraic complexity classesJournal of Complexity, 2008
- 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