Zur Startseite gehen
0,00 €*
Cover: 9783865415271 | The Satisfiability Problem | Algorithms and Analyses | Taschenbuch
Dekorationsartikel gehören nicht zum Leistungsumfang.
The Satisfiability Problem
Algorithms and Analyses
Taschenbuch von Uwe Schöning (u. a.)
Sprache: Englisch
Originalsprache: Deutsch

19,65 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

auf Lager, Lieferzeit 1-2 Werktage

Kategorien:
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.
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.
Ü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.
Zusammenfassung
Englische Ausgabe zu "Das SAT-Problem"
Details
Erscheinungsjahr: 2013
Genre: Informatik, Mathematik, Medizin, Naturwissenschaften, Technik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Reihe: Mathematik für Anwendungen
Inhalt: 184 S.
ISBN-13: 9783865415271
ISBN-10: 386541527X
Sprache: Englisch
Originalsprache: Deutsch
Einband: Kartoniert / Broschiert
Autor: Schöning, Uwe
Torán, Jacobo
Hersteller: Lehmanns Media GmbH
Verantwortliche Person für die EU: Lehmanns Media GmbH, Helmholtzstraße 2-9, D-10587 Berlin, verlag@lehmanns.de
Maße: 241 x 171 x 15 mm
Von/Mit: Uwe Schöning (u. a.)
Erscheinungsdatum: 15.07.2013
Gewicht: 0,458 kg
Artikel-ID: 104760600
Ü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.
Zusammenfassung
Englische Ausgabe zu "Das SAT-Problem"
Details
Erscheinungsjahr: 2013
Genre: Informatik, Mathematik, Medizin, Naturwissenschaften, Technik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Reihe: Mathematik für Anwendungen
Inhalt: 184 S.
ISBN-13: 9783865415271
ISBN-10: 386541527X
Sprache: Englisch
Originalsprache: Deutsch
Einband: Kartoniert / Broschiert
Autor: Schöning, Uwe
Torán, Jacobo
Hersteller: Lehmanns Media GmbH
Verantwortliche Person für die EU: Lehmanns Media GmbH, Helmholtzstraße 2-9, D-10587 Berlin, verlag@lehmanns.de
Maße: 241 x 171 x 15 mm
Von/Mit: Uwe Schöning (u. a.)
Erscheinungsdatum: 15.07.2013
Gewicht: 0,458 kg
Artikel-ID: 104760600
Sicherheitshinweis

Ähnliche Produkte

Diese Website verwendet Cookies, um eine bestmögliche Erfahrung bieten zu können. Mehr Informationen ...