Skip to Main Content
The Art of Computer Programming, Volume 4B: Combinatorial Algorithms
book

The Art of Computer Programming, Volume 4B: Combinatorial Algorithms

by Donald E. Knuth
September 2022
Intermediate to advanced content levelIntermediate to advanced
736 pages
30h 14m
English
Addison-Wesley Professional
Content preview from The Art of Computer Programming, Volume 4B: Combinatorial Algorithms

Index and Glossary

There is an easy index,

so you can find whatever you wish without delay.

McCall’s Cook Book (1963)

When an index entry refers to a page containing a relevant exercise, see also the answer to that exercise for further information. An answer page is not indexed here unless it refers to a topic not included in the statement of the exercise.

# (number sign or hash mark, can indicate hexadecimal constants like # c0ffee), x.

S (boundary set), 242243, 338, 364.

⇒: Implies.

⇔: If and only if.

∅ (the empty set), 549, 594.

0-origin indexing, 74, 424.

0–1 matrices, see Matrices of 0s and 1s.

{0, 1, 2} matrices, 146.

{0, 1, 2, 3} matrices, 467.

1×1×1 cube, 82.

1-in-3 SAT problem, 367.

1SAT problem, 233, 332.

2×2×2 cube, 139, 457 ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1

The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1

Donald E. Knuth

Publisher Resources

ISBN: 9780137926862