Resolution is not automatizable unless W[P] is tractable

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 210-219

  Alekhnovich, M ^a   Razborov, A A ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; INTERPOLATION; PARAMETER ESTIMATION; RANDOM PROCESSES; THEOREM PROVING; TREES (MATHEMATICS);

AUTOMATED THEOREM;

HEURISTIC METHODS;

EID: 0035163031     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.2001.959895     Document Type: Conference Paper

References (16)

1. Minimum propositional proof length is NP-hard to linearly approximate
2. Pseudorandom generators in propositional complexity
3. Tools from higher algebra
4. Schémas d'approximation et complexité paramétrée
5. Non-automatizability of bounded-depth Frege proofs
6. A study of proof search algorithms for resolution and polynomial calculus
7. Simplified and improved resolution lower bounds
8. Propositional proof complexity: Past, present and future
9. On interpolation and automatization for Frege systems
10. Short proofs are narrow - Resolution made simple
11. On the efficiency of polynomial time approximation schemes
12. On the hardness of approximating label cover
13. Complexity of finding short resolution proofs
14. Parameterized complexity: New developments and research frontiers
15. 1 and EF