Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Sasank Mouli:

TR19-024 | 20th February 2019
Russell Impagliazzo, Sasank Mouli, Toniann Pitassi

The Surprising Power of Constant Depth Algebraic Proofs

Revisions: 2

A major open problem in proof complexity is to prove super-polynomial lower bounds for AC^0[p]-Frege proofs. This system is the analog of AC^0[p], the class of bounded depth circuits with prime modular counting gates. Despite strong lower bounds for this class dating back thirty years (Razborov, '86 and Smolensky, '87), ... more >>>

ISSN 1433-8092 | Imprint