Articles liés à The Satisfiability Problem: Algorithms and Analyses
- ÉditeurLehmanns Fachbuchhandlung GmbH
- Date d'édition2013
- ISBN 10 386541527X
- ISBN 13 9783865415271
- ReliureBroché
- Langueanglais
- Nombre de pages184
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 19,95
EUR 7,95 expédition depuis Allemagne vers France
Destinations, frais et délaisRésultats de recherche pour The Satisfiability Problem: Algorithms and Analyses
Image fournie par le vendeur
The Satisfiability Problem : Algorithms and Analyses
Edité par
Lehmanns Media Gmbh Jul 2013, 2013
ISBN 10 : 386541527X
ISBN 13 : 9783865415271
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
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 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. N° de réf. du vendeur 9783865415271
Quantité disponible : 2 disponible(s)
Image d'archives
The Satisfiability Problem Algorithms and Analyses Mathematik fur Anwendungen
Edité par
Lehmanns Fachbuchhandlung GmbH, 2013
ISBN 10 : 386541527X
ISBN 13 : 9783865415271
Neuf
PAP
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur DB-9783865415271
Quantité disponible : 2 disponible(s)
Image d'archives
The Satisfiability Problem Algorithms and Analyses Mathematik fur Anwendungen
Edité par
Lehmanns Fachbuchhandlung GmbH, 2013
ISBN 10 : 386541527X
ISBN 13 : 9783865415271
Neuf
PAP
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur DB-9783865415271
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
The Satisfiability Problem
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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. N° de réf. du vendeur 26267881
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
The Satisfiability Problem
Edité par
Lehmanns Media Gmbh Jul 2013, 2013
ISBN 10 : 386541527X
ISBN 13 : 9783865415271
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
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 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. N° de réf. du vendeur 9783865415271
Quantité disponible : 1 disponible(s)
Image d'archives
The Satisfiability Problem: Algorithms and Analyses
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. pp. 184. N° de réf. du vendeur 126705355
Quantité disponible : 1 disponible(s)
Image d'archives
Das Erfüllbarkeitsproblem Sat, Englische Ausgabe: Algorithms And Analyses
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Brand New. 184 pages. 9.41x6.77x0.55 inches. In Stock. N° de réf. du vendeur __386541527X
Quantité disponible : 2 disponible(s)
Image d'archives
The Satisfiability Problem
Edité par
Lehmanns Media GmbH
ISBN 10 : 386541527X
ISBN 13 : 9783865415271
Ancien ou d'occasion
Couverture souple
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 23848293
Quantité disponible : 1 disponible(s)
Image d'archives
The Satisfiability Problem: Algorithms and Analyses
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 184. N° de réf. du vendeur 26133882132
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
The Satisfiability Problem
Edité par
Lehmanns Media Gmbh Jul 2013, 2013
ISBN 10 : 386541527X
ISBN 13 : 9783865415271
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
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 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. N° de réf. du vendeur 9783865415271
Quantité disponible : 2 disponible(s)