An exponential separation between regular and general resolution

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 448-456

  Alekhnovich, Michael ^a   Johannsen, Jan ^a   Pitassi, Toniann ^a   Urquhart, Alasdair ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; MATHEMATICAL MODELS; POLYNOMIALS; THEOREM PROVING;

EXPONENTIAL SEPARATION; QUASI-POLYNOMIAL;

COMPUTATIONAL COMPLEXITY;

EID: 0036040113     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509973.509974     Document Type: Conference Paper

References (16)

1. Simplified and improved resolution lower bounds
2. Near-optimal separation of tree-like and general resolution
3. A study of proof search algorithms for resolution and polynomial calculus
4. On the relative complexity of resolution restrictions and cutting planes proof systems
5. Homogenization and the polynomial calculus
6. Space bounds for a game on graphs
7. The relative efficiency of propositional proof systems
8. A machine program for theorem proving
9. Davis-putnam resolution versus unrestricted resolution
10. Regular resolution versus unrestricted resolution
11. A DNF without regular shortest consensus path
12. Short proofs for tricky formulas
13. Separation of the monotone NC hierarchy
14. On the complexity of derivation in propositional calculus
15. The complexity of propositional proofs