Substitution and Propositional Proof Complexity

2021 ◽  
pp. 477-496
Author(s):  
Sam Buss
Keyword(s):  
Proof Complexity ◽  
Propositional Proof Complexity ◽  
Propositional Proof

Propositional proof complexity

2003 ◽  
Vol 50 (1) ◽  
pp. 80-82 ◽  
Author(s):  
Alexander Razborov
Keyword(s):  
Proof Complexity ◽  
Propositional Proof Complexity ◽  
Propositional Proof

DEHN FUNCTION AND LENGTH OF PROOFS

2003 ◽  
Vol 13 (05) ◽  
pp. 527-541 ◽  
Author(s):  
JAN KRAJÍČEK
Keyword(s):  
Proof Complexity ◽  
Dehn Function ◽  
Finitely Presented Groups ◽  
Propositional Proof Complexity ◽  
Propositional Proof ◽  
Finitely Presented

We link the Dehn function of finitely presented groups to the length-of-proofs function in propositional proof complexity.

Pseudorandom Generators in Propositional Proof Complexity

2004 ◽  
Vol 34 (1) ◽  
pp. 67-88 ◽  
Author(s):  
Michael Alekhnovich ◽  
Eli Ben-Sasson ◽  
Alexander A. Razborov ◽  
Avi Wigderson
Keyword(s):  
Proof Complexity ◽  
Pseudorandom Generators ◽  
Propositional Proof Complexity ◽  
Propositional Proof

The Complexity of Propositional Proofs

2007 ◽  
Vol 13 (4) ◽  
pp. 417-481 ◽  
Author(s):  
Nathan Segerlind
Keyword(s):  
Computational Complexity ◽  
Lower Bounds ◽  
Proof Complexity ◽  
Propositional Proof Complexity ◽  
Propositional Proof ◽  
Satisfiability Algorithms ◽  
Complexity Theories

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.

Sign in / Sign up

Export Citation Format

Share Document