Contact
How to shop
Delivery
Shopping guide
English
41 b
Delivery to Austria
Up to 30 days for returns
Customers also purchased
/
Paperback
20.19
€
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.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
40.59
€
/
Paperback
13.79
€
Hi! I'm Libroamiko, your book advisor.
How can I help you?