Order Total (1 Item Items):
Shipping Destination:
Satisfiability Problem Algorithms Analyses (5 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (5)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition
- All Conditions
- New (5)
- Used (No further results match this refinement)
Binding
- All Bindings
- Hardcover (No further results match this refinement)
- Softcover (5)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (1)
- Not Print on Demand (5)
Language (1)
Price
- Any Price
- Under US$ 25
- US$ 25 to US$ 50
- Over US$ 50 (No further results match this refinement)
Free Shipping
Seller Location
Seller Rating
-
The Satisfiability Problem Algorithms and Analyses Mathematik fur Anwendungen
Published by Lehmanns Fachbuchhandlung GmbH, 2013
ISBN 10: 386541527X ISBN 13: 9783865415271
Language: English
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
The Satisfiability Problem Algorithms and Analyses Mathematik fur Anwendungen
Published by Lehmanns Fachbuchhandlung GmbH, 2013
ISBN 10: 386541527X ISBN 13: 9783865415271
Language: English
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
US$ 27.06
Convert currencyUS$ 5.64 shipping from United Kingdom to U.S.A.Quantity: 2 available
Add to basketPAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
US$ 29.68
Convert currencyUS$ 8.81 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCondition: New. pp. 184.
-
Condition: New. pp. 184.
-
The Satisfiability Problem : Algorithms and Analyses
Published by Lehmanns Media Gmbh Jul 2013, 2013
ISBN 10: 386541527X ISBN 13: 9783865415271
Language: English
US$ 23.48
Convert currencyUS$ 34.60 shipping from Germany to U.S.A.Quantity: 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.
