The Satisfiability Problem

The Satisfiability Problem : Algorithms and Analyses

4 (1 rating by Goodreads)
By (author)  , By (author) 

Free delivery worldwide

Available. Dispatched from the UK in 4 business days
When will my order arrive?


The satisfiability problem of propositional logic, SAT for short, is the first algorithmic problem that was shown to be NP-complete, and is the cornerstone of virtually all NP-completeness proofs. The SAT problem consists of deciding whether a given Boolean formula has a solution , in the sense of an assignment to the variables making the entire formula to evaluate to true.Over the last few years very powerful algorithms have been devised being able to solve SAT problems with hundreds of thousands of variables. For difficult (or randomly generated) formulas these algorithms can be compared to the proverbial search for the needle in a haystack. This book explains how such algorithms work, for example, by exploiting the structure of the SAT problem with an appropriate logical calculus, like resolution. But also algorithms based on physical principles are more

Product details

  • Paperback | 184 pages
  • 170 x 240 x 13mm | 458g
  • Lehmanns Media GmbH
  • Lehmanns Fachbuchhandlung GmbH
  • Berlin, United Kingdom
  • English
  • New edition
  • 386541527X
  • 9783865415271
  • 1,946,440

Rating details

1 ratings
4 out of 5 stars
5 0% (0)
4 100% (1)
3 0% (0)
2 0% (0)
1 0% (0)
Book ratings by Goodreads
Goodreads is the world's largest site for readers with over 50 million reviews. We're featuring millions of their reader ratings on our book pages to help you find your new favourite book. Close X