| Volume 4A, Combinatorial Algorithms:
Part 1 |
| Title |
Pre-Fascicle |
Pages |
Published
(date, pages) |
| .pdf |
.ps |
| 1.3-4. MMIX |
1 |
1 |
140 |
Vol 1, Fasc 1
(2005-02-24, 144) |
|
| 7. Introduction to combinatorial searching |
0A |
0A |
83 |
Vol 4, Fasc 0
(2008-04-27, 240) |
7.1. Zeros and Ones
7.1.1. Boolean Basics |
0B |
0B |
87 |
| 7.1.2. Boolean evaluation |
0C |
0C |
67 |
| 7.1.3. Bitwise tricks and
techniques |
1A |
1A |
122 |
Vol 4, Fasc 1
(2009-03-23, 272) |
| 7.1.4. Binary decision diagrams |
1B |
1B |
150 |
7.2. Generating all possibilities
7.2.1. Combinatorial generators
7.2.1.1. Generating all n-tuples |
2A |
2A |
72 |
Vol 4, Fasc 2
(2005-02-24, 144) |
| 7.2.1.2. Generating all
permutations |
2B |
2B |
66 |
| 7.2.1.3. Generating all combinations |
3A |
3A |
65 |
Vol 4, Fasc 3
(2005-08-05, 160) |
| 7.2.1.4-5. Generating all
partitions |
3B |
3B |
92 |
| 7.2.1.6. Generating all trees |
4A |
4A |
87 |
Vol 4, Fasc 4
(2006-02-16, 128) |
|
7.2.1.7. History of combinatorial generation |
4B |
4B |
42 |
|
Volume 4, Fascicles 0-4 (bundled together) |
933 |
Vol 4, Fasc 0-4
(2009-04-03, 944) |
| Volume 4A, Combinatorial Algorithms: Part 1 |
883
+xvi |
Vol 4A
(2011-01-24, 912) |
|
| Volume 4B, Combinatorial Algorithms:
Part 2 |
| Mathematical Preliminaries Redux |
5A |
5A |
54 |
(2015-10-03) |
| 7.2.2. Backtrack Programming |
5B |
5B |
58 |
(2016-05-25) |
| 7.2.2.1. Dancing Links |
5C |
5C |
26 |
(2016-09-12) |
| 7.2.2.2. Satisfiability |
6A |
6A |
318 |
Vol 4, Fasc 6
(2015-12-18, 320) |