2 search results - page 1 / 1 » Does Advice Help to Prove Propositional Tautologies |
SAT
2009
Springer
13 years 11 months ago
2009
Springer
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
CSL
2005
Springer
13 years 10 months ago
2005
Springer
The proof system G∗ 0 of the quantified propositional calculus corresponds to NC1 , and G∗ 1 corresponds to P, but no formula-based proof system that corresponds log space rea...