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

Answers to Exercises

It isn’t that they can’t see the solution.It is that they can’t see the problem.

— G. K. CHESTERTON, The Scandal of Father Brown (1935)

Notes on the Exercises

1. A moderately easy problem for a mathematically inclined reader.

2. The author will reward you if you are first to report an error in the statement of an exercise or in its answer, assuming that he or she is suitably sagacious.

3. See H. Poincaré, Rendiconti del Circolo Matematico di Palermo 18 (1904), 45–110; R. H. Bing, Annals of Math. (2) 68 (1958), 17–37; G. Perelman, arXiv:math/0211159 [math.DG] (2002), 39 pages; 0303109 and 0307245 [math.DG] (2003), 22+7 pages.

Mathematical Preliminaries Redux

1. (a) A beats B in 5+0+5+5+0+5 cases out of 36; B beats C in ...

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