Refine your search

  • Books (7)

to

Custom price range (£)

to

Gu Jun Pardalos Panos M (7 results)

Author: 
Refine with Advanced Search
  • Language: English

    Published by American Mathematical Society, 1997

    0821804790 / 9780821804797

    • Hardcover

    Seller: Buchpark, Trebbin, GermanyBuchpark

    5-star seller
    Contact seller

    Condition: Used - Very good

    Original price: £ 81.33
    10% off

    Current price: £ 73.20

    £ 88.01 shipping 
    Ships from Germany to U.S.A.

    Quantity: 1 available

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

  • Condition: New

    £ 188.99

    £ 15.00 shipping 
    Ships from United Kingdom to U.S.A.

    Quantity: 2 available

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

  • Language: English

    Published by American Mathematical Society, US, 1997

    0821804790 / 9780821804797

    • Hardcover

    Seller: Rarewaves.com USA, London, LONDO, United KingdomRarewaves.com USA

    5-star seller
    Contact seller

    Condition: New

    £ 215.95

     Free Shipping 
    Ships from United Kingdom to U.S.A.

    Quantity: 1 available

    Hardback. Condition: 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.…

  • Language: English

    Published by American Mathematical Society, US, 1997

    0821804790 / 9780821804797

    • Hardcover

    Seller: Rarewaves.com UK, London, United KingdomRarewaves.com UK

    5-star seller
    Contact seller

    Condition: New

    £ 200.55

    £ 65.00 shipping 
    Ships from United Kingdom to U.S.A.

    Quantity: 1 available

    Hardback. Condition: 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.…

  • Language: English

    Published by Amer Mathematical Society, 1997

    0821804790 / 9780821804797

    • Hardcover

    Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections

    5-star seller
    Contact seller

    Condition: New

    £ 263.23

    £ 18.33 shipping 
    Ships from United Kingdom to U.S.A.

    Quantity: 2 available

    Condition: New. In English.

  • Language: English

    Published by Amer Mathematical Society, 1997

    0821804790 / 9780821804797

    • Hardcover

    Seller: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore

    4-star seller
    Contact seller

    Condition: New

    £ 286.81

    £ 8.02 shipping 
    Ships within U.S.A.

    Quantity: 1 available

    Condition: 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.…

  • Language: English

    Published by Amer Mathematical Society, 1997

    0821804790 / 9780821804797

    • Hardcover

    Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrelandKennys Bookshop and Art Galleries Ltd.

    5-star seller
    Contact seller

    Condition: New

    £ 323.06

    £ 7.96 shipping 
    Ships from Ireland to U.S.A.

    Quantity: 1 available

    Condition: 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. . . . .…