Satisfiability problem algorithms analyses par schoening uwe (2 résultats)
- Couverture souple
Vendeur : medimops, Berlin, Allemagnemedimops
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion - Satisfaisant
EUR 11,43
EUR 10,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Etat : 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.
- Couverture souple
Vendeur : AHA-BUCH GmbH, Einbeck, AllemagneAHA-BUCH GmbH
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 24,97
EUR 62,29 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Taschenbuch. Etat : 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 sens…e 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.
