Zustand: New. 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. Artikel-Nr. 26267881

Verk�ufer kontaktieren

Neu kaufen

EUR 20,78

W�hrung umrechnen

Versand: Gratis

Innerhalb Deutschlands

Versandziele, Kosten & Dauer

Anzahl: 2 verf�gbar

In den Warenkorb

Foto des Verk�ufers

The Satisfiability Problem

Uwe Sch�ning

Verlag: Lehmanns Media Gmbh Jul 2013, 2013

ISBN 10: 386541527X ISBN 13: 9783865415271

Neu Taschenbuch

Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland

Verk�uferbewertung 5 von 5 Sternen

Taschenbuch. Zustand: Neu. Neuware -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.Lehmanns Media GmbH, Helmholtzstra�e 2-9, 10587 Berlin 184 pp. Englisch. Artikel-Nr. 9783865415271

Verk�ufer kontaktieren

Neu kaufen

EUR 19,95

W�hrung umrechnen

Versand: EUR 1,99

Innerhalb Deutschlands

Versandziele, Kosten & Dauer

Anzahl: 2 verf�gbar

In den Warenkorb

Foto des Verk�ufers

The Satisfiability Problem : Algorithms and Analyses

Uwe Sch�ning

Verlag: Lehmanns Media Gmbh Jul 2013, 2013

ISBN 10: 386541527X ISBN 13: 9783865415271

Neu Taschenbuch

Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland

Verk�uferbewertung 5 von 5 Sternen

Taschenbuch. Zustand: Neu. Neuware - 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. Artikel-Nr. 9783865415271

Verk�ufer kontaktieren