ISBN: 9780821804797 - satisfiability problem: theory and applications (dimacs series in discrete mathematics and theoretical computer science) (7 Ergebnisse)

ISBN: 
Mit der Detailsuche verfeinern

Optimieren Sie Ihre Suche

  • Bücher (7)

bis

Benutzerdefinierte Preisspanne (EUR)

bis

  • Sprache: Englisch

    Verlag: American Mathematical Society, 1997

    0821804790 / 9780821804797

    • Hardcover

    Anbieter: Buchpark, Trebbin, DeutschlandBuchpark

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Gebraucht - Gut

    Sonderangebot

    Aktueller Preis: EUR 84,79

    EUR 105,00 Versand 
    Versand von Deutschland nach USA

    Anzahl: 1 verfügbar

    Zustand: Gut. Zustand: Gut | Seiten: 724 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

  • Zustand: Neu

    EUR 232,24

    EUR 17,90 Versand 
    Versand von Vereinigtes Königreich nach USA

    Anzahl: 2 verfügbar

    Hardcover. Zustand: Brand New. 724 pages. 10.50x7.50x1.75 inches. In Stock.

  • Sprache: Englisch

    Verlag: American Mathematical Society, US, 1997

    0821804790 / 9780821804797

    • Hardcover

    Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes KönigreichRarewaves.com USA

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 257,65

     Versand gratis 
    Versand von Vereinigtes Königreich nach USA

    Anzahl: 1 verfügbar

    Hardback. Zustand: 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, algorithmists, 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.…

  • Sprache: Englisch

    Verlag: American Mathematical Society, US, 1997

    0821804790 / 9780821804797

    • Hardcover

    Anbieter: Rarewaves.com UK, London, Vereinigtes KönigreichRarewaves.com UK

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 246,45

    EUR 77,55 Versand 
    Versand von Vereinigtes Königreich nach USA

    Anzahl: 1 verfügbar

    Hardback. Zustand: 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, algorithmists, 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.…

  • Sprache: Englisch

    Verlag: Amer Mathematical Society, 1997

    0821804790 / 9780821804797

    • Hardcover

    Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 323,47

    EUR 21,87 Versand 
    Versand von Vereinigtes Königreich nach USA

    Anzahl: 2 verfügbar

    Zustand: New. In English.

  • Sprache: Englisch

    Verlag: Amer Mathematical Society, 1997

    0821804790 / 9780821804797

    • Hardcover

    Anbieter: Kennys Bookstore, Olney, MD, USAKennys Bookstore

    Verkäufer/-in mit 4 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 342,18

    EUR 9,57 Versand 
    Versand innerhalb von USA

    Anzahl: 1 verfügbar

    Zustand: 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 algorithmic 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.…

  • Sprache: Englisch

    Verlag: Amer Mathematical Society, 1997

    0821804790 / 9780821804797

    • Hardcover

    Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandKennys Bookshop and Art Galleries Ltd.

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 374,20

    EUR 9,50 Versand 
    Versand von Irland nach USA

    Anzahl: 1 verfügbar

    Zustand: 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 algorithmic 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. . . . .…