Abstract
AbstractPropositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have connections with computational complexity, theories of arithmetic, and satisfiability algorithms. This is article includes a broad survey of the field, and a technical exposition of some recently developed techniques for proving lower bounds on proof sizes.
Publisher
Cambridge University Press (CUP)
Reference161 articles.
1. A Compressed Breadth-First Search for Satisfiability
2. Hertel P. and Pitassi T. , An exponential time/space speedup for resolution, Technical Report TR07-046, Electronic Colloquium on Computational Complexity, 2007.
3. Razborov A. , Pseudorandom generators hard for k-DNF resolution and polynomial calculus resolution, Submitted to the Journal of Glacial Refereeing. Manuscript available at http://genesis.mi.ras.ru/~razborov/, 2003.
4. Some Consequences of Cryptographical Conjectures forS12and EF
5. Bounded Arithmetic, Propositional Logic and Complexity Theory
Cited by
159 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献