Back to Results
First PageMeta Content
Computational complexity theory / Logic in computer science / Mathematical logic / Proof theory / Automated theorem proving / Frege system / Proof complexity / Function / Switching lemma / Theoretical computer science / Mathematics / Logic


A Exponential Lower Bounds for AC0 -Frege Imply Superpolynomial Frege Lower Bounds YUVAL FILMUS and TONIANN PITASSI, University of Toronto RAHUL SANTHANAM, University of Edinburgh
Add to Reading List

Document Date: 2014-04-05 15:13:04


Open Document

File Size: 310,89 KB

Share Result on Facebook
UPDATE