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. 184 pp. Englisch. N� de ref. del art�culo: 9783865415271

Contactar al vendedor

Comprar nuevo

EUR 19,95

Convertir moneda

Gastos de env�o: EUR 11,00

De Alemania a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen del vendedor

The Satisfiability Problem : Algorithms and Analyses

Uwe Sch�ning

Publicado por Lehmanns Media Gmbh Jul 2013, 2013

ISBN 10: 386541527X ISBN 13: 9783865415271

Nuevo Taschenbuch

Librería: AHA-BUCH GmbH, Einbeck, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

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. N� de ref. del art�culo: 9783865415271

Contactar al vendedor

Comprar nuevo

EUR 19,95

Convertir moneda

Gastos de env�o: EUR 14,50

De Alemania a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: 2 disponibles

A�adir al carrito

Imagen de archivo

The Satisfiability Problem: Algorithms and Analyses

Schoening, Uwe; Toran, Jacobo

Publicado por Lehmanns Media GmbH

ISBN 10: 386541527X ISBN 13: 9783865415271

Nuevo Tapa blanda

Librería: Majestic Books, Hounslow, Reino Unido

Calificaci�n del vendedor: 5 de 5 estrellas

Condici�n: New. pp. 184. N� de ref. del art�culo: 126705355

Contactar al vendedor

Comprar nuevo

EUR 26,81

Convertir moneda

Gastos de env�o: EUR 10,50

De Reino Unido a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen de archivo

Das Erf�llbarkeitsproblem Sat, Englische Ausgabe: Algorithms And Analyses

The Satisfiability Problem; Sch�ning, Uwe; Tor�n, Jacobo

Publicado por Lehmanns Media, 2013

ISBN 10: 386541527X ISBN 13: 9783865415271

Nuevo Paperback

Librería: Revaluation Books, Exeter, Reino Unido

Calificaci�n del vendedor: 5 de 5 estrellas

Paperback. Condici�n: Brand New. 184 pages. 9.41x6.77x0.55 inches. In Stock. N� de ref. del art�culo: __386541527X

Contactar al vendedor

Comprar nuevo

EUR 26,64

Convertir moneda

Gastos de env�o: EUR 11,87

De Reino Unido a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: 2 disponibles

A�adir al carrito

Imagen de archivo

The Satisfiability Problem

Schoening, Uwe; Toran, Jacobo

Publicado por Lehmanns Media GmbH

ISBN 10: 386541527X ISBN 13: 9783865415271

Antiguo o usado Tapa blanda

Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America

Calificaci�n del vendedor: 5 de 5 estrellas

Condici�n: As New. Unread book in perfect condition. N� de ref. del art�culo: 23848293

Contactar al vendedor

Comprar usado

EUR 21,07

Convertir moneda

Gastos de env�o: EUR 17,53

De Estados Unidos de America a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen del vendedor

The Satisfiability Problem

Uwe Sch�ning

Publicado por Lehmanns Media Gmbh Jul 2013, 2013

ISBN 10: 386541527X ISBN 13: 9783865415271

Nuevo Taschenbuch

Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

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.Lehmanns Media GmbH, Helmholtzstra�e 2-9, 10587 Berlin 184 pp. Englisch. N� de ref. del art�culo: 9783865415271

Contactar al vendedor

Comprar nuevo

EUR 19,95

Convertir moneda

Gastos de env�o: EUR 19,99

De Alemania a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: 2 disponibles

A�adir al carrito

Imagen del vendedor

The Satisfiability Problem

Sch�ning, Uwe|Tor�n, Jacobo

Publicado por Lehmanns Media, 2013

ISBN 10: 386541527X ISBN 13: 9783865415271

Nuevo Tapa blanda

Librería: moluna, Greven, Alemania

Calificaci�n del vendedor: 4 de 5 estrellas

Condici�n: 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 ref. del art�culo: 26267881

Contactar al vendedor