The Satisfiability Problem (PDF)
Algorithms and Analyses
(Sprache: Englisch)
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...
sofort als Download lieferbar
Printausgabe Fr. 24.90
eBook (pdf)
Fr. 16.00
inkl. MwSt.
- Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „The Satisfiability Problem (PDF)“
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.
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.
Autoren-Porträt von Uwe Schöning, Jacobo Torán
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.
Bibliographische Angaben
- Autoren: Uwe Schöning , Jacobo Torán
- 2013, 184 Seiten, Englisch
- Verlag: Lehmanns
- ISBN-10: 3865416489
- ISBN-13: 9783865416483
- Erscheinungsdatum: 03.06.2013
Abhängig von Bildschirmgrösse und eingestellter Schriftgrösse kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: PDF
- Grösse: 1.43 MB
- Ohne Kopierschutz
Sprache:
Englisch
Family Sharing
eBooks und Audiobooks (Hörbuch-Downloads) mit der Familie teilen und gemeinsam geniessen. Mehr Infos hier.
Kommentar zu "The Satisfiability Problem"
0 Gebrauchte Artikel zu „The Satisfiability Problem“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "The Satisfiability Problem".
Kommentar verfassen