Skip to main content
SpringerLink
Log in

Average-Case Analysis for the MAX-2SAT Problem

  • Conference paper
Theory and Applications of Satisfiability Testing - SAT 2006 (SAT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4121))

Abstract

We propose a “planted solution model” for discussing the average-case complexity of the MAX-2SAT problem. We show that for a large range of parameters, the planted solution (more precisely, one of the planted solution pair) is the optimal solution for the generated instance with high probability. We then give a simple linear time algorithm based on a message passing method, and we prove that it solves the MAX-2SAT problem with high probability under our planted solution model.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Achlioptas, D., Jia, H., Moore, C.: Hiding satisfying assignments: two are better than one. J. AI Research 24, 623–639 (2005)

    MATH  MathSciNet  Google Scholar 

  2. Onsjö, M., Watanabge, O.: Simple algorithms for graph partition problems, Res. Report C-212, Dept. of Math. and Comput. Sci., Tokyo Tech (2005), http://www.is.titech.ac.jp/research/research-report/C/index.html

  3. Scott, A.D., Sorkin, G.B.: Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 382–395. Springer, Heidelberg (2003)

    Google Scholar 

  4. Watanabe, O., Yamamoto, M.: Res. Report, Dept. of Math. and Comput. Sci., Tokyo Tech. (in preparation, 2006)

    Google Scholar 

  5. Yamamoto, M.: Generating instances for MAX2SAT with optimal solutions, Theory of Computing Systems (to appear)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Math. and Comput. Sci., Tokyo Inst. of Technology, Japan

    Osamu Watanabe & Masaki Yamamoto

Authors
  1. Osamu Watanabe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Masaki Yamamoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria

    Armin Biere

  2. Department of Computer Science, Cornell University, 14853, Ithaca, NY, U.S.A.

    Carla P. Gomes

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Watanabe, O., Yamamoto, M. (2006). Average-Case Analysis for the MAX-2SAT Problem. In: Biere, A., Gomes, C.P. (eds) Theory and Applications of Satisfiability Testing - SAT 2006. SAT 2006. Lecture Notes in Computer Science, vol 4121. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814948_27

Download citation

  • DOI: https://doi.org/10.1007/11814948_27

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-37207-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation