3.0 KiB
| title | chunk | source | category | tags | date_saved | instance |
|---|---|---|---|---|---|---|
| The Art of Computer Programming | 3/3 | https://en.wikipedia.org/wiki/The_Art_of_Computer_Programming | reference | science, encyclopedia | 2026-05-05T08:35:49.830398+00:00 | kb-cron |
Volume 4, Fascicle 5: Mathematical Preliminaries Redux; Backtracking; Dancing Links. (Addison-Wesley, 2019-11-22) xiii+382pp, ISBN 978-0-13-467179-6. Errata: [23] (2020-03-27) Volume 4, Fascicle 6: Satisfiability. (Addison-Wesley, 2015-12-08) xiii+310pp, ISBN 978-0-13-439760-3. Errata: [24] (2020-03-26)
==== Pre-fascicles ==== Pre-fascicles contain draft of evolving material for future Fascicles. They are put online primarily so that experts in the field can check the contents before distributing them to a wider audience. Volume 1
Pre-fascicle 1: MMIX was revised and published as Volume 1, fascicle 1. Volume 4
Pre-fascicles 0A: Introduction to Combinatorial Searching, 0B: Boolean Basics, and 0C: Boolean Evaluation were revised and published as Volume 4, fascicle 0. Pre-fascicles 1A: Bitwise Tricks and Techniques and 1B: Binary Decision Diagrams were revised and published as Volume 4, fascicle 1. Pre-fascicles 2A: Generating All n-Tuples and 2B: Generating All Permutations were revised and published as Volume 4, fascicle 2. Pre-fascicles 3A: Generating All Combinations and 3B: Generating All Partitions were revised and published as Volume 4, fascicle 3. Pre-fascicles 4A: Generating All Trees and 4B: History of Combinatorial Generation were revised and published as Volume 4, fascicle 4. Pre-fascicles 5A: Preliminaries Redux, 5B: Introduction to Backtracking, and 5C: Dancing Links were revised and published as Volume 4, fascicle 5. Pre-fascicle 6A: Satisfiability was revised and published as Volume 4, fascicle 6. Pre-fascicle 7A: Constraint Satisfaction was revised and published as Volume 4, fascicle 7. The remaining pre-fascicles contain draft material that is set to appear in future fascicles and volumes.
Volume 4, Pre-fascicle 8A: Hamiltonian Paths and Cycles (PDF unmantained Version) Volume 4, Pre-fascicle 8B: Cliques Volume 4, Pre-fascicle 9B: A Potpourri of Puzzles Volume 4, Pre-fascicle 9C: Estimating Backtrack Costs Volume 4, Pre-fascicle 12A: Components and Traversal (PDF Version) Volume 4, Pre-fascicle 14A: Bipartite Matching Volume 4, Pre-fascicle 16A: Introduction to Recursion
== See also == Introduction to Algorithms
== References == Notes
Citations
Sources
== External links ==
Overview of topics (Knuth's personal homepage) Announcement of Volume 1 of 'The Art of Computer Programming' Oral history interview with Donald E. Knuth at Charles Babbage Institute, University of Minnesota, Minneapolis, 2001. Knuth discusses software patenting, structured programming, collaboration and his development of TeX. The oral history discusses the writing of The Art of Computer Programming. "Robert W Floyd, In Memoriam", by Donald E. Knuth, 2003 - (on the influence of Bob Floyd) TAoCP and its Influence of Computer Science (Softpanorama)