Articoli correlati a The Satisfiability Problem: Algorithms and Analyses:...
Compra nuovo
Visualizza questo articolo
EUR 19,95
EUR 7,95 per la spedizione da Germania a Italia
Destinazione, tempi e costiRisultati della ricerca per The Satisfiability Problem: Algorithms and Analyses:...
Immagini fornite dal venditore
The Satisfiability Problem : Algorithms and Analyses
Editore:
Lehmanns Media Gmbh Jul 2013, 2013
ISBN 10: 386541527X
ISBN 13: 9783865415271
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783865415271
Quantità: 2 disponibili
Foto dell'editore
The Satisfiability Problem Algorithms and Analyses Mathematik fur Anwendungen
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo DB-9783865415271
Quantità: 1 disponibili
Foto dell'editore
The Satisfiability Problem Algorithms and Analyses Mathematik fur Anwendungen
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo DB-9783865415271
Quantità: 1 disponibili
Immagini fornite dal venditore
The Satisfiability Problem
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo 26267881
Quantità: 1 disponibili
Immagini fornite dal venditore
The Satisfiability Problem
Editore:
Lehmanns Media Gmbh Jul 2013, 2013
ISBN 10: 386541527X
ISBN 13: 9783865415271
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783865415271
Quantità: 1 disponibili
Immagini fornite dal venditore
The Satisfiability Problem
Editore:
Lehmanns Media Gmbh Jul 2013, 2013
ISBN 10: 386541527X
ISBN 13: 9783865415271
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783865415271
Quantità: 1 disponibili
Foto dell'editore
Das Erfüllbarkeitsproblem Sat, Englische Ausgabe: Algorithms And Analyses
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. 184 pages. 9.41x6.77x0.55 inches. In Stock. Codice articolo __386541527X
Quantità: 1 disponibili
Foto dell'editore
The Satisfiability Problem
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition. Codice articolo 23848293
Quantità: 1 disponibili
Foto dell'editore
The Satisfiability Problem
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 23848293-n
Quantità: 3 disponibili
Foto dell'editore
The Satisfiability Problem
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 23848293-n
Quantità: 1 disponibili