
The Satisfiability Problem
Kurzinformation



inkl. MwSt. Versandinformationen
Artikel zZt. nicht lieferbar
Artikel zZt. nicht lieferbar

Beschreibung
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 considered. von Schöning, Uwe und Torán, Jacobo
Produktdetails

So garantieren wir Dir zu jeder Zeit Premiumqualität.
Über den Autor
The authors, Dr. Uwe Schöning and Dr. Jacobo Toran, are professors in the Institute of Theoretical Computer Science at the University of Ulm, Germany.
- Hardcover
- 300 Seiten
- Erschienen 1971
- Springer
- Kartoniert
- 392 Seiten
- Erschienen 2007
- Springer
- Hardcover
- 504 Seiten
- Erschienen 1973
- Springer
- Kartoniert
- 355 Seiten
- Erschienen 2006
- Springer
- Hardcover
- 228 Seiten
- Erschienen 1989
- Springer
- Hardcover
- 176 Seiten
- Erschienen 1980
- De Gruyter Mouton
- Gebunden
- 459 Seiten
- Erschienen 2018
- De Gruyter Mouton
- Taschenbuch
- 218 Seiten
- Erschienen 2012
- Morgan & Claypool Publishers
- Taschenbuch
- 178 Seiten
- Erschienen 2014
- Morgan & Claypool Publishers
- Hardcover
- 264 Seiten
- World Scientific Publishing...
- Taschenbuch
- 242 Seiten
- Erschienen 2008
- Dover Pubn Inc