The intractability of resolution

Theoretical Computer Science

Volumn 39, Issue C, 1985, Pages 297-308

  Haken, Armin ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000076101     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(85)90144-6     Document Type: Article

References (10)

1. On the lengths of proofs in the propositional calculus, Preliminary version
2. Corrections for "On the lengths of proofs in the propositional calculus preliminary version"
3. The relative efficiency of propositional proof systems
4. A computing procedure for quantification theory
5. On the complexity of regular resolution and the Davis-Putnam procedure
6. A note on regular resolution
7. A machine oriented logic based on the resolution principle
8. On the complexity of derivations in propositional calculus