9780821804797 - satisfiability problem: theory and applications (dimacs: series in discrete mathematics and theoretical computer science) (6 resultados)
- Tapa dura
Librería: Buchpark, Trebbin, AlemaniaBuchpark
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Bueno
EUR 94,21
Envío por EUR 105,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Condición: Gut. Zustand: Gut | Seiten: 724 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.
- Tapa dura
Librería: Revaluation Books, Exeter, Reino UnidoRevaluation Books
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 227,72
Envío por EUR 17,55Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Hardcover. Condición: Brand New. 724 pages. 10.50x7.50x1.75 inches. In Stock.
- Tapa dura
Librería: Rarewaves.com USA, London, LONDO, Reino UnidoRarewaves.com USA
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 252,61
Gastos de envío gratisSe envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardback. Condición: New. The satisfiability (SAT) problem is central in mathematical logic, computing theory, and many industrial applications. There has been a strong relationship between the theory, the algorithms, and the applications of the SAT problem. This book aims to bring together work by the best theorists, algorithmi…sts, and practitioners working on the SAT problem and on industrial applications, as well as to enhance the interaction between the three research groups. The book features the application of theoretical/algorithmic results to practical problems and presents practical problems for theoretical/algorithmic study.Major topics covered in the book include practical and industrial SAT problems and benchmarks, significant case studies and applications of the SAT problem and SAT algorithms, new algorithms and improved techniques for satisfiability testing, specific data structures and implementation details of the SAT algorithms, and the theoretical study of the SAT problem and SAT algorithms. It features: a comprehensive review of SAT research work over the past 25 years; the most recent research results; and a spectrum of algorithmic issues and applications.
- Tapa dura
Librería: Rarewaves.com UK, London, Reino UnidoRarewaves.com UK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 233,72
Envío por EUR 76,04Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardback. Condición: New. The satisfiability (SAT) problem is central in mathematical logic, computing theory, and many industrial applications. There has been a strong relationship between the theory, the algorithms, and the applications of the SAT problem. This book aims to bring together work by the best theorists, algorithmi…sts, and practitioners working on the SAT problem and on industrial applications, as well as to enhance the interaction between the three research groups. The book features the application of theoretical/algorithmic results to practical problems and presents practical problems for theoretical/algorithmic study.Major topics covered in the book include practical and industrial SAT problems and benchmarks, significant case studies and applications of the SAT problem and SAT algorithms, new algorithms and improved techniques for satisfiability testing, specific data structures and implementation details of the SAT algorithms, and the theoretical study of the SAT problem and SAT algorithms. It features: a comprehensive review of SAT research work over the past 25 years; the most recent research results; and a spectrum of algorithmic issues and applications.
- Tapa dura
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de AmericaKennys Bookstore
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 324,43
Envío por EUR 9,08Se envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: New. The satisfiability (SAT) problem is central in mathematical logic, computing theory, and many industrial applications. This book features the application of theoretical/algorithmic results to practical problems and presents practical problems for theoretical/algorithmic study. It also includes a spectrum of algor…ithmic issues and applications. Editor(s): Du, Ding-Zhu; Gu, Jun; Pardalos, Panos M. Series: Series in Discrete Mathematics & Theoretical Computer Science. Num Pages: 724 pages. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 184 x 258 x 39. Weight in Grams: 1510. . 1997. Hardcover. . . . . Books ship from the US and Ireland.
- Tapa dura
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 374,20
Envío por EUR 9,50Se envía de Irlanda a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: New. The satisfiability (SAT) problem is central in mathematical logic, computing theory, and many industrial applications. This book features the application of theoretical/algorithmic results to practical problems and presents practical problems for theoretical/algorithmic study. It also includes a spectrum of algor…ithmic issues and applications. Editor(s): Du, Ding-Zhu; Gu, Jun; Pardalos, Panos M. Series: Series in Discrete Mathematics & Theoretical Computer Science. Num Pages: 724 pages. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 184 x 258 x 39. Weight in Grams: 1510. . 1997. Hardcover. . . . .
