The Art Of Computer Programming, Volume 4, Fascicle 6: Satisfiability

Paperback | December 8, 2015

byDonald E. Knuth

not yet rated|write a review

This multivolume work on the analysis of algorithms has long been recognized 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 marveled 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 humor 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.

 

Pricing and Purchase Info

$33.21 online
$36.99 list price (save 10%)
In stock online
Ships free on orders over $25
HURRY, ONLY 4 LEFT!

From the Publisher

This multivolume work on the analysis of algorithms has long been recognized 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’...

Donald E. Knuth is known throughout the world for his pioneering work on algorithms and programming techniques, for his invention of the TEX and METAFONT systems for computer typesetting, and for his prolific and influential writing. Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes fu...

other books by Donald E. Knuth

The Art of Computer Programming, Volumes 1-4A Boxed Set
The Art of Computer Programming, Volumes 1-4A Boxed Set

Book & Toy|Mar 3 2011

$207.30 online$259.99list price(save 20%)
Concrete Mathematics: A Foundation For Computer Science
Concrete Mathematics: A Foundation For Computer Science

Hardcover|Feb 28 1994

$71.67 online$83.99list price(save 14%)
Companion to the Papers of Donald Knuth
Companion to the Papers of Donald Knuth

Paperback|Feb 15 2012

$45.50

see all books by Donald E. Knuth
Format:PaperbackDimensions:320 pages, 9.4 × 6.3 × 0.9 inPublished:December 8, 2015Publisher:Pearson EducationLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:0134397606

ISBN - 13:9780134397603

Customer Reviews of The Art Of Computer Programming, Volume 4, Fascicle 6: Satisfiability

Reviews

Extra Content

Table of Contents

Chapter 7: Combinatorial Searching         0

7.2. Generating All Possibilities     0

7.2.1. Generating Basic Combinatorial Patterns     0

7.2.2. Basic  Backtrack    0

 

Answers to Exercises       185

Index to Algorithms and Theorems       292

Index and Glossary           293