The Satisfiability Problem: Algorithms and Analyses (Mathematik für Anwendungen, Band 3) - Softcover

Schöning, Uwe; Torán, Jacobo

 
9783865415271: The Satisfiability Problem: Algorithms and Analyses (Mathematik für Anwendungen, Band 3)
Softcover
ISBN 10: 386541527X ISBN 13: 9783865415271
Verlag: Lehmanns Media, 2013

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorin bzw. 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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Lehmanns Media
Erscheinungsdatum
2013
Sprache
Englisch
ISBN 10 
386541527X
ISBN 13 
9783865415271
Einband
Taschenbuch
Anzahl der Seiten
184
Kontakt zum Hersteller
verlag@lehmanns.de
verlag@lehmanns.de

Helmholtzstraße 2-9
Berlin
10587
Deutschland