Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

ICALP
1999
Springer

favoriteEmaildiscussreport

62views Programming Languages» more ICALP 1999»

Bounded Depth Arithmetic Circuits: Counting and Closure

13 years 9 months ago

Bounded Depth Arithmetic Circuits: Counting and Closure

Download ftp.cs.rutgers.edu

Eric Allender, Andris Ambainis, David A. Mix Barri

Real-time Traffic

ICALP 1999 | Programming Languages |

claim paper

Related Content

» Arithmetic Circuits A Chasm at Depth Four

» Reconstruction of Generalized Depth3 Arithmetic Circuits with Bounded Top Fanin

» Quantum Circuits with Unbounded Fanout

» Lower Bounds and Separations for Constant Depth Multilinear Circuits

» Arithmetic circuits the chasm at depth four gets wider

» NonCommutative Arithmetic Circuits Depth Reduction and Size Lower Bounds

» Depth Reduction for Circuits with a Single Layer of Modular Counting Gates

» Resistant Polynomials and Stronger Lower Bounds for DepthThree Arithmetical Formulas

» Functional Characterizations of Uniform Logdepth and Polylogdepth Circuit Families

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	ICALP
Authors	Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh

Comments (0)