Randomized Algorithms for 3-SAT | Theory of Computing Systems Skip to main content
Springer Nature Link
Log in

Randomized Algorithms for 3-SAT

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

Schoning proposed a simple yet efficient randomized algorithm for solving the k-SAT problem. In the case of 3-SAT, the algorithm has an expected running time of poly(n)·(4/3)n = O(1.334n). In this paper we present randomized algorithms and show that one of them has O(1.3302n) expected running time, improving Schoning's algorithm. (Note. At this point, the fastest randomized algorithm for 3-SAT is the one given by Iwama and Tamaki that runs in O(1.324n).)

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Informatik 2, Universitat Dortmund, 44221 Dortmund, Germany

    Thomas Hofmeister

  2. Abteilung fur Theoretische Informatik, Universitat Ulm, Oberer Eselsberg, 89069 Ulm, Germany

    Uwe Schoning & Rainer Schuler

  3. Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, W8-25, Tokyo 152-8552, Japan

    Osamu Watanabe

Authors
  1. Thomas Hofmeister
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Uwe Schoning
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rainer Schuler
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Osamu Watanabe
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Thomas Hofmeister, Uwe Schoning, Rainer Schuler or Osamu Watanabe.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hofmeister, T., Schoning, U., Schuler, R. et al. Randomized Algorithms for 3-SAT. Theory Comput Syst 40, 249–262 (2007). https://doi.org/10.1007/s00224-005-1275-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-005-1275-6

Keywords

Search

Navigation