Placeholder text

Go to cart

The Satisfiability Problem

By Jacobo Torán

The Satisfiability Problem book

The Satisfiability Problem

Only 1 item left in stock
Description
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.
Product details
Binding:
Paperback
Number of Pages:
184
Release Date:
2013-07-01
Publication Date:
2013-07-31
Publisher:
Lehmanns Media GmbH
Languages:
Original: English
ISBN10:
386541527X
ISBN13:
9783865415271
Weight:
458 g
Height:
171 cm
Width:
241 cm
Thickness:
15 cm

Condition

Show more

Show less
Good
The items bear minimal signs of past use, such as light scratches or memories in the form of markings. These signs of wear give the items a charming character and tell stories of their previous owners, while not affecting their functionality.
Available immediately
€9,99

Incl. VAT, plus shipping costs

PayPal
Visa
Mastercard
American Express
Only 1 item left in stock

Verified second-hand article

Verified second-hand item

Free shipping from 19€

€9,99