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.
This fascicle covers three separate topics:
Mathematical Preliminaries Redux 1
Chapter 7: Combinatorial Searching7.2.2 Backtrack Programming 28
188.8.131.52 Dancing Links 63
Answers to Exercises 182Appendix C: index to Algorithms and Theorems 357Appendix E: Answers to Puzzles in the Answers 358
Index and Glossary 361
A note on the PDF edition of Volume 4, Fascicle 5
The authorized PDF version of Volume 4, Fascicle 5 was not created by Mathematical Sciences Publishers (MSP). The typeface of this PDF is lighter than those produced by MSP, and it includes all the correct links, renders code correctly, and has been approved by Donald Knuth.