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.
€9.99
A propos de l’auteur
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.Achetez cet ebook et obtenez-en 1 de plus GRATUITEMENT !
Langue Anglais ● Format PDF ● Pages 184 ● ISBN 9783865416483 ● Taille du fichier 1.5 MB ● Maison d’édition Lehmanns ● Lieu Berlin ● Pays DE ● Publié 2013 ● Téléchargeable 24 mois ● Devise EUR ● ID 3165003 ● Protection contre la copie DRM sociale
Plus d’ebooks du même auteur(s) / Éditeur
74 264 Ebooks dans cette catégorie
