The Art of Computer Programming, Volume 4Knuth's multivolume work is widely recognized as the definitive description of classical computer science: at the end of 1999, these books were named among the best twelve physical-science monographs of the century by American Scientist. The three volumes included in this set have each been revised recently to reflect developments in the field. As earlier editions clearly demonstrated, they comprise an invaluable resource in programming theory and practice for students, researchers, and practitioners alike. Countless readers have spoken about the profound personal influence of Knuth's work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.--Cover. |
Common terms and phrases
a₁ Algorithm H approximation asymptotic b₁ b₂ binomial tree bit string blocks c₁ Chase's sequence Cj+1 coefficient combination ct compute conjugate corresponds decreasing defined Durfee square elements equivalent Eulerian trail exactly example Ferrers diagram Find formula function genlex order Gray code Gray path Hamiltonian paths hence increasing induction integer partition largest lexicographic order lexicographically smallest loopless Math modulo multicombinations multiset n-tuples n₁ namely near-perfect node notation number of partitions obtained otherwise set partitions of 1,...,n permutations polynomial previous exercise proof Prove random partition recurrence representation restricted growth strings revolving-door rightmost rook saddle point saddle point method scheme set partitions Show simplicial complex solution step Stirling's approximation t-combinations Theorem total number universal cycle vectors zero