The Satisfiability Problem
Algorithms and Analyses
Lehmanns Media (Publisher)
Published in July 2013
Book
Paperback/Softback
184 pages
978-3-86541-527-1 (ISBN)
Description
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.
More details
Series
Language
English
Place of publication
Berlin
Germany
Target group
Professional and scholarly
College/higher education
Edition type
New edition
Dimensions
Height: 241 mm
Width: 171 mm
Thickness: 15 mm
Weight
458 gr
ISBN-13
978-3-86541-527-1 (9783865415271)
Schweitzer Classification
Other editions
Additional editions

E-Book
06/2013
1st Edition
Lehmanns Media
€9.99
Available for download
Persons
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.