9783865415271 - the Satisfiability Problem: Algorithms and Analyses (mathematik Fur Anwendungen) by Uwe Schöning; Jacobo Torán (14 results)
- Softcover
Seller: medimops, Berlin, Germanymedimops
Contact seller5-star sellerCondition: Used - Good
US$ 14.52
US$ 11.44 shippingShips from Germany to U.S.A.Quantity: 1 available
Condition: good. Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present.
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
US$ 23.84
US$ 2.64 shippingShips within U.S.A.Quantity: 1 available
Condition: As New. Unread book in perfect condition.
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
US$ 26.31
US$ 2.64 shippingShips within U.S.A.Quantity: 1 available
Condition: New.
- Softcover
Seller: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contact seller5-star sellerCondition: New
US$ 28.96
Free ShippingShips within U.S.A.Quantity: 1 available
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
- Softcover
Seller: PBShop.store UK, Fairford, GLOS, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: New
US$ 27.41
US$ 5.55 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
- Softcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
US$ 30.46
US$ 13.35 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Brand New. 184 pages. 9.41x6.77x0.55 inches. In Stock.
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
US$ 27.40
US$ 20.03 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Condition: New.
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
US$ 28.11
US$ 20.03 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Condition: As New. Unread book in perfect condition.
- Softcover
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
US$ 23.51
US$ 26.31 shippingShips from Germany to U.S.A.Quantity: 1 available
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 s…ense 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.
- Softcover
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
US$ 24.48
US$ 56.04 shippingShips from Germany to U.S.A.Quantity: 1 available
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.
- Softcover
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
US$ 23.51
US$ 68.63 shippingShips from Germany to U.S.A.Quantity: 1 available
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 s…ense 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, Helmholtzstr. 2-9, 10587 Berlin 184 pp. Englisch.
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 29.42
US$ 71.25 shippingShips from Germany to U.S.A.Quantity: 1 available
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.
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 23.98
US$ 80.07 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. The Satisfiability Problem | Algorithms and Analyses | Uwe Schöning (u. a.) | Taschenbuch | Mathematik für Anwendungen | 184 S. | Englisch | 2013 | Lehmanns Media GmbH | EAN 9783865415271 | Verantwortliche Person für die EU: Lehmanns Media GmbH, Volker Thurner, Helmholtzstr. 2-9, 10587 Berlin, verlag…[at]lehmanns[dot]de | Anbieter: preigu.
- Softcover
Seller: Books-by-Floh, Paderborn, GermanyBooks-by-Floh
Contact seller4-star sellerCondition: New
US$ 30.53
US$ 120.11 shippingShips from Germany to U.S.A.Quantity: 1 available
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 s…ense 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.
