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

Appendix D—Index to Combinatorial Problems

The purpose of this appendix is to present concise descriptions of the major problems treated in the present book, and to associate each problem description with the name under which it can be found in the main index. Some of these problems can be solved efficiently, while others appear to be very difficult in general although special cases might be easy. No indication of problem complexity is given here.

Combinatorial problems have a chameleon-like tendency to assume many forms. For example, certain properties of graphs and hypergraphs are equivalent to other properties of 0–1 matrices; and an m × n matrix of 0s and 1s can itself be regarded as a Boolean function of its index variables (i, j), with ...

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