Lower bounds for space in resolution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1683, Issue , 1999, Pages 362-373

  Torán, Jacobo ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

Complexity measures; Lower bounds; Pebbling game; Resolution; Space

Indexed keywords

OPTICAL RESOLVING POWER;

COMPLEXITY MEASURES; LOWER BOUNDS; OPTIMAL LOWER BOUND; PEBBLING GAME; PIGEONHOLE PRINCIPLE; RESOLUTION REFUTATION; SPACE; UPPER BOUND;

COMPUTER CIRCUITS;

EID: 57749173620     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48168-0_26     Document Type: Conference Paper

References (14)

1. Alekhnovich, M., Ben-Sasson, E., Razborov A. and Wigderson, A.: Space complexity in Propositional Calculus. Preliminary draft, July 1999.
2. Beame, P. and Pitassi, T.: Simplified and Improved Resolution Lower Bounds. In Proc. 37th IEEE Symp. on Foundations of Computer Science, (1996) 274-282.
3. Ben-Sasson, E. and Widgerson, A.: Short proofs are narrow, resolution made simple. In Proc. 31st ACM Symp. on Theory of Computing (1999) 517-527.
4. Buss, S. and Pitassi, T.: Resolution and the Weak Pigeonhole Principle. In Computer Science Logic 97, (1997), proceedings to appear in Springer Verlag.
5. Chvátal, V. and Szemerédi, E.: Many hard examples for resolution. Journal of the ACM, 35 (1988) 759-768.
6. Esteban, J.L. and Torán, J.: Space bounds for resolution. In Proc. 16th STACS, Springer Verlag LNCS 1563 (1999) 551-561.
7. Haken, A: The intractability of resolution Theoretical Computer Science 35 (1985) 297-308.
8. Kleine Büning, H. and Lettman, T.: Aussangenlogik: Deduktion und Algorithmen, B.G. Teubner Stuttgart (1994).
9. Margulis, A.: Explicit construction of concentrators. Problems Information Transmission 9 (1973) 71-80.
10. Messner, J.: Personal communication 1999.
11. Schöning, U.: Better expanders and superconcentrators by Kolmogorov complexity. In Proceedings 4th International Colloquium on Structural Information and Communication Complexity, Sirocco 97 Carleton Scientific (1997) 138-151.
12. Schöning, U.: Resolution proofs, exponential bounds and Kolmogorov complexity. In Proc. 22nd MFCS Conference, Springer Verlag LNCS 1295 (1997) 110-116.
13. Tseitin, G.S. On the complexity of derivation in propositional calculus. In Studies in Constructive Mathematics and Mathematical Logic, Part 2. Consultants Bureau (1968) 115-125.
14. Urquhart, A.: Hard examples for resolution. Journal of the ACM 34 (1987) 209-219.