Knuth, Donald E. The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1. (English) Zbl 1354.68001 Upper Saddle River, NJ: Addison-Wesley (ISBN 978-0-201-03804-0/pbk). xv, 883 p. (2011). Publisher’s description: Knuth’s multivolume analysis of algorithms is widely recognized as the definitive description of classical computer science. The first three volumes of this work have long comprised a unique and invaluable resource in programming theory and practice. Scientists have marveled at the beauty and elegance of Knuths analysis, while practicing programmers have successfully applied his “cookbook” solutions to their day-to-day problems. For previous parts of Volume 4 see [Zbl 0895.68054; Zbl 1127.68068; Zbl 1178.68372]. Cited in 1 ReviewCited in 71 Documents MSC: 68-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science 05A05 Permutations, words, matrices 05A10 Factorials, binomial coefficients, combinatorial functions 05A17 Combinatorial aspects of partitions of integers 05A18 Partitions of sets 05C30 Enumeration in graph theory 68W40 Analysis of algorithms PDF BibTeX XML Cite \textit{D. E. Knuth}, The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1. Upper Saddle River, NJ: Addison-Wesley (2011; Zbl 1354.68001)