Sciweavers

FOCS
2008
IEEE
13 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 expo...
Manindra Agrawal, V. Vinay