Space complexity of random formulae in resolution

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2001, Pages 42-51

  Ben Sasson, Eli ^a   Galesi, Nicola ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; GAME THEORY; GRAPH THEORY; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY DISTRIBUTIONS; THEOREM PROVING;

CONJUNCTIVE NORMAL FUNCTION; PIGEONHOLE PRINCIPLE; POLYNOMIAL TIME COMPUTABLE FUNCTION; SPACE COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 0034872564     PISSN: 10930159     EISSN: None     Source Type: Journal    
DOI: 10.1109/CCC.2001.933871     Document Type: Article

References (14)

1. Setting 2 variables at time yields a new lower bound for random 3-SAT
2. Space complexity in propositional calculus
3. The efficiency of resolution and Davis Putnam procedures
4. Simplified and improved resolution lower bound
5. Short proofs are narrow - resolution made simple
6. Many hard examples for resolutions
7. The relative efficiency of propositional proof systems
8. Typical random 3-SAT formulae and the satisfiability problem
9. Space bounds for resolution
10. The intractability of resolution
11. Bounding the unsatisfiability thresholds for 3-SAT
12. Lower bounds for natural proof systems
13. Lower bounds for space in resolution
14. Hard examples for resolution