Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Das SAT-Problem

  • HAUPTBEITRAG
  • DAS SAT-PROBLEM
  • Published:
Informatik-Spektrum Aims and scope

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
$34.99 /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 excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Biere A, Heule M, van Maaren H, Walsh T (2009) Handbook of Satisfiability. IOS Press

  2. Cook SA (1971) The complexity of theorem-proving procedures. Third Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, New York, pp 151–158

    Google Scholar 

  3. Davis M, Logemann G, Loveland D (1962) A machine program for theorem proving. Commun ACM 5:394–397

    Article  MATH  MathSciNet  Google Scholar 

  4. Davis M, Putnam H (1960) A computing procedure for quantification theory. JACM 7:201–215

    Article  MATH  MathSciNet  Google Scholar 

  5. Garey MR, Johnson DS (1979) Computers and Intractability – a Guide to the Theory of NP-Completeness. Freeman

  6. Kullmann O (2008) Present and future of practical SAT solving. Complexity of Constraints. Springer Lect Notes Comput Sci 5250:283–319

  7. Levin L (1973) Universal search problems. Problemy Peredaci Informaticii 9:115–116

    MATH  Google Scholar 

  8. Monien B, Speckenmeyer E (1985) Solving satisfiability in less than 2n steps. Discret Appl Math 10:287–295

    Article  MATH  MathSciNet  Google Scholar 

  9. Schöning U (2002) A probabilistic algorithm for k-SAT based on limited local search and restart. Algorithmica 32(4):615–623

    Article  MATH  MathSciNet  Google Scholar 

  10. Stamatiou YC (2003) Threshold phenomena: the computer scientist’s viewpoint. Bull Eur Assoc Theor Comput Sci 80:199–234

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Theoretische Informatik, Universität Ulm, James-Franck-Ring, 89069, Ulm, Deutschland

    Uwe Schöning

Authors
  1. Uwe Schöning
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Uwe Schöning.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schöning, U. Das SAT-Problem. Informatik Spektrum 33, 479–483 (2010). https://doi.org/10.1007/s00287-010-0459-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00287-010-0459-x

Search

Navigation