Satisfiability problem algorithms analyses de schoening uwe (2 resultados)
- Tapa blanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 19,95
Envío por EUR 66,87Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: 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.
- Tapa blanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 20,35
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: 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.
