Skip to main content
SpringerLink
Log in
SpringerLink
Log in

An Optimal Lower Bound for Resolution with 2-Conjunctions

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 2002 (MFCS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2420))

  • 490 Accesses

Abstract

A lower bound is proved for refutations of certain clause sets in a generalization of Resolution that allows cuts on conjunctions of width 2. The hard clauses are the Tseitin graph formulas for a class of logarithmic degree expander graphs. The bound is optimal in the sense that it is truly exponential in the number of variables.

Research supported by DFG grant no. Jo 291/2-2

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Atserias and M. L. Bonet. On the automatizability of resolution and related propositional proof systems. Technical Report ECCC TR02-010, Electronic Colloquium on Computational Complexity, 2002.

    Google Scholar 

  2. A. Atserias, M. L. Bonet, and J. L. Esteban. Lower bounds for the weak pigeonhole principle beyond resolution, 2002. To appear in Information and Computation. Preliminary Version in Proc. 28th International Colloquium on Automata Languages and Programming, 2001.

    Google Scholar 

  3. R. Beigel and D. Eppstein. 3-coloring in time O(1.3446n): a no-MIS algorithm. In Proc. 36th IEEE Symposiom on Foundations of Computer Science, pages 444–452, 1995.

    Google Scholar 

  4. E. Ben-Sasson. Hard examples for bounded-depth Frege. To appear in Proc. 34th ACM Symposium on Theory of Computing, 2002.

    Google Scholar 

  5. E. Ben-Sasson and A. Wigderson. Short proofs are narrow — resolution made simple. Journal of the ACM, 48:149–169, 2001. Preliminary Version in Proc. 31st Symposium on Theory of Computing, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  6. B. Bollobás. Random Graphs. Academic Press, 1985.

    Google Scholar 

  7. J. Krajíček. On the weak pigeonhole principle. Fundamenta Mathematicae, 170:123–140, 2001.

    Article  MathSciNet  MATH  Google Scholar 

  8. N. Segerlind, S. R. Buss, and R. Impagliazzo. A switching lemma for small restrictions and lower bounds for k-DNF resolution. Submitted for publication, 2002.

    Google Scholar 

  9. G. Tseitin. On the complexity of derivation in propositional calculus. In A. O. Slisenko, editor, Studies in Constructive Mathematics and Mathematical Logic, Part 2, pages 115–125. Consultants Bureau, 1970.

    Google Scholar 

  10. A. Urquhart. Hard examples for resolution. Journal of the ACM, 34:209–219, 1987.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Ludwig-Maximilians-Universität München, Germany

    Jan Johannsen & N. S. Narayanaswamy

Authors
  1. Jan Johannsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. S. Narayanaswamy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097, Warszawa, Poland

    Krzysztof Diks  & Wojciech Rytter  & 

  2. Department of Computer Science, Liverpool University, Peach Street, Liverpool, L69 7ZF, UK

    Wojciech Rytter

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Johannsen, J., Narayanaswamy, N.S. (2002). An Optimal Lower Bound for Resolution with 2-Conjunctions. In: Diks, K., Rytter, W. (eds) Mathematical Foundations of Computer Science 2002. MFCS 2002. Lecture Notes in Computer Science, vol 2420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45687-2_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-45687-2_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44040-6

  • Online ISBN: 978-3-540-45687-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation