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


Exponential Lower Bounds for AC0 -Frege Imply Superpolynomial Frege Lower Bounds Yuval Filmus1 ? , Toniann Pitassi1 ? , and Rahul Santhanam2 1 University of Toronto, yuvalf,
Add to Reading List

Document Date: 2011-06-22 20:53:40

Open Document

File Size: 330,06 KB

Share Result on Facebook

Company

CNF / /

/

Facility

University of Edinburgh / University of Toronto / /

IndustryTerm

non-deterministic algorithms / artificial algorithms / non-deterministic algorithm / propositional proof systems / natural algorithms / low depth proof systems / stronger proof systems / proof systems / natural systems / possible algorithm / natural proof systems / /

Organization

University of Toronto / University of Edinburgh / /

Person

Ai / /

Technology

simulation / non-deterministic algorithms / non-deterministic algorithm / possible algorithm / somewhat artificial algorithms / /

SocialTag