Space complexity in propositional calculus

SIAM Journal on Computing

Volumn 31, Issue 4, 2002, Pages 1184-1211

  Alekhnovich, Michael ^a   Ben Sasson, Eli ^a   Razborov, Alexander A ^a   Wigderson, Avi ^a  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

Frege; Polynomial calculus; Proof complexity; Resolution

Indexed keywords

BOOLEAN FUNCTIONS; BOUNDARY CONDITIONS; LOGIC GATES; MANY VALUED LOGICS; MATHEMATICAL MODELS; POLYNOMIALS; SEMANTICS; SYNTACTICS; THEOREM PROVING; TURING MACHINES;

FREGE SYSTEM; POLYNOMIAL CALCULUS; PROOF COMPLEXITY; SPACE COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 0036520257     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539700366735     Document Type: Article

References (17)

1. Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
2. Propositional proof complexity: Past, present and future
3. A study of proof search algorithms for resolution and polynomial calculus
4. Using the Groebner basis algorithm to find proofs of unsatisfiability
5. The relative efficiency of propositional proof systems
6. Space bounds for resolution
7. Lower bounds for the polynomial calculus and the Groebner basis algorithm
8. Lower bounds for natural proof systems
9. Short proofs for trickly formulas
10. Read-once-branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus
11. Short resolution proofs for a sequence of tricky formulas
12. Lower bounds for space in resolution
13. On the complexity of derivation in propositional calculus
14. The complexity of propositional proofs