Published by Lehmanns Fachbuchhandlung GmbH, 2013
ISBN 10: 386541527X ISBN 13: 9783865415271
Language: English
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
Published by Lehmanns Fachbuchhandlung GmbH, 2013
ISBN 10: 386541527X ISBN 13: 9783865415271
Language: English
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
US$ 27.06
Convert currencyQuantity: 2 available
Add to basketPAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
Seller: Majestic Books, Hounslow, United Kingdom
US$ 29.68
Convert currencyQuantity: 1 available
Add to basketCondition: New. pp. 184.
Condition: New. pp. 184.
Published by Lehmanns Media Gmbh Jul 2013, 2013
ISBN 10: 386541527X ISBN 13: 9783865415271
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
US$ 23.48
Convert currencyQuantity: 2 available
Add to basketTaschenbuch. Condition: 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.