Size space tradeoffs for resolution

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 457-464

  Ben Sasson, Eli ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; GRAPH THEORY; HEURISTIC METHODS; PROBLEM SOLVING; THEOREM PROVING;

CONSTANT WIDTH; LINEAR SIZE; REGULAR RESOLUTION; SIZE SPACE TRADEOFFS;

COMPUTATIONAL COMPLEXITY;

EID: 0036038648     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509973.509975     Document Type: Conference Paper

References (35)

1. Space complexity in propositional calculus
2. An exponential separation between regular and general resolution found
3. Resolution is not automatizable unless W[P] is tractable
4. Exponential separations between restricted resolution and cutting planes proof systems
5. On the complexity of unsatisfiability proofs for random k-CNF formulas
6. Simplified and improved resolution lower bounds
7. Canonical expressions in Boolean algebra
8. Linear and negative resolution are weaker than resolution
9. Resolution and the weak pigeonhole principle
10. Resolution proof of generalized pigeonhole principles
11. Space complexity of random formulae in resolution
12. Near-optimal separation of general and tree-like resolution
13. Short proofs are narrow - Resolution made simple
14. Space bounds for a game on graphs
15. Using the Groebner basis algorithm to find proofs of unsatisfiability
16. An observation on time-storage trade-off
17. Storage requirements for deterministic polynomial time recognizable languages
18. The relative efficiency of propositional proof systems
19. Many hard examples for resolution
20. A machine program for theorem proving
21. A computing procedure for quantification theory
22. Space bounds for resolution
23. The intractibility of resolution
24. On time vs. space
25. Lower bounds for the polynomial-calculus and the Groebnes basis algorithm
26. Upper and lower bounds on time-space tradeoffs
27. Separation of the Monotone NC Hierarchy
28. Regular resolution lower bounds for the weak pigeonhole principle
29. Resolution lower bounds for the weak pigeonhole principle
30. A machine-oriented logic based on the resolution principle
31. Lower bounds for space in resolution
32. On the complexity of derivation in propositional calculus
33. Hard examples for resolution