Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 2010: Algorithms and Computation pp 73–84Cite as

Improved Randomized Algorithms for 3-SAT

  • Conference paper

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

Abstract

This pager gives a new randomized algorithm which solves 3-SAT in time O(1.32113n). The previous best bound is O(1.32216n) due to Rolf (J. SAT, 2006). The new algorithm uses the same approach as Iwama and Tamaki (SODA 2004), but exploits the non-uniform initial assignment due to Hofmeister et al. (STACS 2002) against the Schöning’s local search (FOCS 1999).

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Spencer, J.H.: The probabilistic method, 3rd edn. Wiley Interscience, Hoboken (2008)

    Book  MATH  Google Scholar 

  2. Baumer, S., Schuler, R.: Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 150–161. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Brüeggemann, T., Kern, W.: An improved deterministic local search algorithm for 3-SAT. Theoretical Computer Science 329(1-3), 303–313 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  4. Dantsin, E.: Two systems for proving tautologies based on the split method. Journal of Mathematical Science 22, 1293–1305 (1983)

    Article  MATH  Google Scholar 

  5. Dantsin, E., Goerdt, A., Hirsch, E.A., Kannan, R., Kleinberg, J., Papadimitriou, C., Raghavan, P., Schöning, U.: A deterministic \(2 - \frac{2}{k+1}\) algorithm for k-SAT based on local search. Theoretical Computer Science 289(1), 69–83 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hofmeister, T., Schöning, U., Schuler, R., Watanabe, O.: A probabilistic 3-SAT algorithm further improved. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 192–202. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Iwama, K., Tamaki, S.: Improved upper bounds for 3-SAT. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 328–329 (2004)

    Google Scholar 

  8. Kullmann, O.: New methods for 3-SAT decision and worst-case analysis. Theoretical Computer Science 223(1-2), 1–72 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  9. Luckhardt, H.: Obere Komplexitätsschranken für TAUT-Entscheidungen. In: Proceedings of Frege Conference 1984, pp. 331–337 (1984)

    MathSciNet  MATH  Google Scholar 

  10. Monien, B., Speckenmeyer, E.: 3-Satisfiability is testable in O(1.62r) steps. Technical Report Beicht Nr. 3/1979, Reihe Theoretische Informatik, Universität-Gesamthochschule-Paderborn (1979)

    Google Scholar 

  11. Monien, B., Speckenmeyer, E.: Solving satisfiability less than 2n steps. Discrete Applied Mathematics 10, 287–295 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  12. Paturi, R., Pudlák, P., Saks, M.E., Zane, F.: An improved exponential-time algorithm for k-SAT. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 628–637 (1998)

    Google Scholar 

  13. Paturi, R., Pudlák, P., Saks, M.E., Zane, F.: An improved exponential-time algorithm for k-SAT. Journal of the ACM 52(3), 337–364 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  14. Paturi, R., Pudlák, P., Zane, F.: Satisfiability coding lemma. In: Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 566–574 (1997)

    Google Scholar 

  15. Rodosek, R.: A new approach on solving 3-Satisfiability. In: Pfalzgraf, J., Calmet, J., Campbell, J. (eds.) AISMC 1996. LNCS, vol. 1138, pp. 197–212. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  16. Rolf, D.: 3-SAT ∈ RTIME(O(1.32971n)). Diploma thesis, Department Of Computer Science, Humboldt University Berlin, Germany (Janury 2003)

    Google Scholar 

  17. Rolf, D.: 3-SAT ∈ RTIME(O(1.32793n)). Electronic Colloquium on Computational Complexity, TR03-054 (2003)

    Google Scholar 

  18. Rolf, D.: Improved bound for the PPSZ/Schöning-algorithm for 3-SAT. Journal on Satisfiability, Boolean Modeling and Computation 1, 111–122 (2006)

    MATH  Google Scholar 

  19. Scheder, D.: Guided search and a faster deterministic algorithm for 3-SAT. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 60–71. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  20. Schiermeyer, I.: Solving 3-Satisfiability in less than 1.579n steps. In: Martini, S., Börger, E., Kleine Büning, H., Jäger, G., Richter, M.M. (eds.) CSL 1992. LNCS, vol. 702, pp. 379–394. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  21. Schiermeyer, I.: Pure literal look ahead: An O(1.497n) 3-Satisfiability algorithm. In: Proceedings of the Workshop on the Satisfiability Problem, pp. 127–136 (1996)

    Google Scholar 

  22. Schöning, U.: A Probabilistic algorithm for k-SAT and constraint satisfaction problems. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 410–414 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kyoto University, Yoshida Honmachi, Sakyo-ku, Kyoto, 606-8501, Japan

    Kazuo Iwama, Kazuhisa Seto & Suguru Tamaki

  2. East Japan Railway Company, Japan

    Tadashi Takai

Authors
  1. Kazuo Iwama
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kazuhisa Seto
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tadashi Takai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Suguru Tamaki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, KAIST, Gwahangno 335, 305-701, Yuseong-gu, Daejeon, Korea

    Otfried Cheong  & Kyung-Yong Chwa  & 

  2. School of Computer Science and Engineering, Seoul National University, 151-742, Seoul, Korea

    Kunsoo Park

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Iwama, K., Seto, K., Takai, T., Tamaki, S. (2010). Improved Randomized Algorithms for 3-SAT. In: Cheong, O., Chwa, KY., Park, K. (eds) Algorithms and Computation. ISAAC 2010. Lecture Notes in Computer Science, vol 6506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17517-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17517-6_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17516-9

  • Online ISBN: 978-3-642-17517-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation