Sciweavers

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

11

TCS
1998

favoriteEmaildiscussreport

79views Theoretical Computer Science» more TCS 1998»

Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds

13 years 4 months ago

Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds

Download www.cs.rutgers.edu

Eric Allender, Jia Jiao, Meena Mahajan, V. Vinay

Real-time Traffic

TCS 1998 | Theoretical Computer Science |

claim paper

Related Content

» Arithmetic Circuits A Chasm at Depth Four

» Lower Bounds and Separations for Constant Depth Multilinear Circuits

» Arithmetic circuits the chasm at depth four gets wider

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

» Powering requires threshold depth 3

» TradeOff Lower Bounds for Stack Machines

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	1998
Where	TCS
Authors	Eric Allender, Jia Jiao, Meena Mahajan, V. Vinay

Comments (0)