AGOTADO EN ESTE MOMENTO

Art of Computer Programming, Volume 4, Fascicle 6, The: Satisfiability by Donald Knuth (Paperback, 2015)

Acerca de este artículo

Product Information

This multivolume work on the analysis of algorithms has long been recognised as the definitive description of classical computer science. The four volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marvelled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his cookbook solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humour found in his books. To continue the fourth and later volumes of the set, and to update parts of the existing volumes, Knuth has created a series of small books called fascicles, which are published at regular intervals. Each fascicle encompasses a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete. Volume 4 Fascicle 6 This fascicle, brimming with lively examples, forms the middle third of what will eventually become hardcover Volume 4B. It introduces and surveys Satisfiability,'' one of the most fundamental problems in all of computer science: Given a Boolean function, can its variables be set to at least one pattern of 0s and 1s that will make the function true? Satisfiability is far from an abstract exercise in understanding formal systems. Revolutionary methods for solving such problems emerged at the beginning of the twenty-first century, and they've led to game-changing applications in industry. These so-called SAT solvers'' can now routinely find solutions to practical problems that involve millions of variables and were thought until very recently to be hopelessly difficult. Fascicle 6 presents full details of seven different SAT solvers, ranging from simple algorithms suitable for small problems to state-of-the-art algorithms of industrial strength. Many other significant topics also arise in the course of the discussion, such as bounded model checking, the theory of traces, Las Vegas algorithms, phase changes in random processes, the efficient encoding of problems into conjunctive normal form, and the exploitation of global and local symmetries. More than 500 exercises are provided, arranged carefully for self-instruction, together with detailed answers.

Product Identifiers

Publisher
Pearson Education (Us)
ISBN-13
9780134397603
eBay Product ID (ePID)
222320444

Product Key Features

Author
Donald Knuth
Publication Name
Art of Computer Programming, Volume 4, Fascicle 6, The: Satisfiability
Format
Paperback
Language
English
Subject
Computer Science
Publication Year
2015
Type
Textbook
Number of Pages
320 Pages

Dimensions

Item Height
239mm
Item Width
164mm
Item Weight
560g

Additional Product Features

Title_Author
Donald Knuth
Country/Region of Manufacture
United States

Comprar por categoría

Art of Computer Programming, Volume 4, Fascicle 6, The: Satisfiability by Donald Knuth (Paperback, 2015)

También te pueden interesar

Revistas de deportes, artes marciales

Libros prácticos y de consulta artes en italiano

Libros de literatura y narrativa The Walking Dead

Libros de literatura y narrativa The Walking Dead en inglés

Cómics de año de publicación 2015

Cómics y novelas gráficas americanos de año de publicación 2015

Acerca de este artículo

Product Information

Product Identifiers

Product Key Features

Dimensions

Additional Product Features