Search results for The Satisfiability Problem: Algorithms and Analyses:...
Stock Image
The Satisfiability Problem
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 23848293
Stock Image
The Satisfiability Problem Algorithms and Analyses Mathematik fur Anwendungen
Published by
Lehmanns Fachbuchhandlung GmbH, 2013
ISBN 10: 386541527X
ISBN 13: 9783865415271
New
PAP
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # DB-9783865415271
Stock Image
The Satisfiability Problem
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 23848293-n
Stock Image
The Satisfiability Problem: Algorithms and Analyses
Seller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. pp. 184. Seller Inventory # 126705355
Stock Image
Das Erfüllbarkeitsproblem Sat, Englische Ausgabe: Algorithms And Analyses
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 184 pages. 9.41x6.77x0.55 inches. In Stock. Seller Inventory # __386541527X
Stock Image
The Satisfiability Problem
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 23848293-n
Stock Image
The Satisfiability Problem
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 23848293
Seller Image
The Satisfiability Problem
Published by
Lehmanns Media Gmbh Jul 2013, 2013
ISBN 10: 386541527X
ISBN 13: 9783865415271
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. 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. 184 pp. Englisch. Seller Inventory # 9783865415271
Seller Image
The Satisfiability Problem
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. 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. Seller Inventory # 26267881
Seller Image
The Satisfiability Problem
Published by
Lehmanns Media Gmbh Jul 2013, 2013
ISBN 10: 386541527X
ISBN 13: 9783865415271
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. 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.Lehmanns Media GmbH, Helmholtzstraße 2-9, 10587 Berlin 184 pp. Englisch. Seller Inventory # 9783865415271