Name
Abstract | ||
|---|---|---|
Propositional 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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.2178/bsl/1203350879 | BULLETIN OF SYMBOLIC LOGIC |
Keywords | DocType | Volume |
satisfiability,lower bound | Journal | 13 |
Issue | ISSN | Citations |
4 | 1079-8986 | 37 |
PageRank | References | Authors |
1.18 | 79 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nathan Segerlind | 1 | 223 | 11.22 |