Space Complexity of Random Formulae in Resolution

Random Structures and Algorithms

Volumn 23, Issue 1, 2003, Pages 92-109

  Ben Sasson, Eli ^a   Galesi, Nicola ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042806264     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10089     Document Type: Article

References (14)

1. D. Achlioptas, Setting 2 variables at time yields a new lower bound for random 3-SAT, Proc 32th STOC, 2000, pp. 28-37.
2. M. Alekhnovich, E. Ben-Sasson, A. A. Razborov, and A. Wigderson, Space complexity in prepositional calculus, Proc 32nd STOC, 2000, pp. 358-367.
3. P. Beame, R. Karp, T. Pitassi, and M. Saks, The efficiency of resolution and Davis Putnam procedures, Proc 30th Annu ACM Symp Theory Comput (STOC-98), 23-26 May 1998, ACM Press, New York, pp. 561-571.
4. P. Beame and T. Pitassi, Simplified and improved resolution lower bound, FOCS'96, 1996, pp. 274-282.
5. E. Ben-Sasson and A. Wigderson, Short proofs are narrow-resolution made simple, Proc 31st STOC, 1999, p. 517-526.
6. V. Chvátal and E. Szemerédi, Many hard examples for resolutions, J ACM 35 (1988), 759-768.
7. S. A. Cook and R. Reckhow, The relative efficiency of propositional proof systems, J Symbolic Logic 44 (1979), 36-50.
8. O. Dubois, Y. Boufkhad, and J. Mandler, Typical random 3-SAT formulae and the satisfiability problem, 11-th SODA, 2000, pp. 126-127.
9. J. L. Esteban and J. Toran, Space bounds for Resolution, Proc 16th STAGS, 1999, pp. 530-539.
10. A. Haken, The intractability of resolution. Theoret Comput Sci 35 (1985), 297-308.
11. S. Janson, Y. C. Stamatiou, and M. Vamvakari, Bounding the unsatisfiability threshold for 3-SAT, Random Structure Algorithms 17(2) (2000), 118-116.
12. J. Torán, Lower bounds for space in resolution, Proc CSL 1999, 1999, pp. 362-373.
13. A. Urquhart, Hard examples for resolution, J ACM 34 (1987), 209-219.
14. M. Zito, An upper bound on the space complexity of random formulae in resolution, Electron Coll Comput Complexity, Report TR01-079, 2001, available at www.eccc.uni-trier.de/eccc/.