The Satisfiability Problem
Lehmanns Media (Verlag)
978-3-86541-527-1 (ISBN)
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.
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.
I was delighted to see how nicely the authors were able to cover such a variety of topics with elegance. I cannot resist saying that the introduction to SAT on page 9 is absolutely the best I ever expect to see in any book!
Donald E. Knuth, Stanford University
This book gives lucid descriptions of algorithms for SAT that are better than you would think! A must-read for anyone in theory.
William Gasarch, University of Maryland
It was a wonderful surprise to see a deep mathematical analysis of important algorithms for SAT presented so clearly and concisely. This is an excellent introductory book for studying the foundations of constraint satisfaction.
Osamu Watanabe, Tokyo Institute of Technology
| Erscheint lt. Verlag | 25.7.2013 |
|---|---|
| Reihe/Serie | Mathematik für Anwendungen ; 3 | Mathematik für Anwendungen ; 3 |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 170 x 240 mm |
| Gewicht | 454 g |
| Einbandart | kartoniert |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Schlagworte | Algorithmus • Aussagenlogik • SAT |
| ISBN-10 | 3-86541-527-X / 386541527X |
| ISBN-13 | 978-3-86541-527-1 / 9783865415271 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
