Sciweavers

Share
FOCS
2008
IEEE

Arithmetic Circuits: A Chasm at Depth Four

8 years 11 months ago
Arithmetic Circuits: A Chasm at Depth Four
We show that proving exponential lower bounds on depth four arithmetic circuits imply exponential lower bounds for unrestricted depth arithmetic circuits. In other words, for exponential sized circuits additional depth beyond four does not help. We then show that a complete black-box derandomization of Identity Testing problem for depth four circuits with multiplication gates of small fanin implies a nearly complete derandomization of general Identity Testing.
Manindra Agrawal, V. Vinay
Added 29 May 2010
Updated 29 May 2010
Type Conference
Year 2008
Where FOCS
Authors Manindra Agrawal, V. Vinay
Comments (0)
books