Ebook Free Download | The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 | Knuth has written many books considered classics. Some of the previous works have been set-up for where the real fun is - Combinatorics. In one of my own columns, I say "Never trust the brute-force power of a computer network to do the job of a combinatorialist." In 1967, John P. Robinson and Arthur J. Bernstein published an optimal Golomb ruler with 24 marks (OGR24). Their solution was confirmed in 2004 by a massive distributed effort using tens of thousand of computer years.Knuth is attempting to discuss all the algorithms that will still be important 50 years from now. The amount of speed given using these algorithms is staggering. Some examples topics in the book:
Page 222 - Algorithm S: Breadth-first synthesis of BDDs
Page 293 - Balanced and Complementary Gray codes.
Page 424 - Stirling numbers and set partitions.
Page 449 - Generating binary trees
Helpful mathematical illustrations feature prominently throughout the book, and pretty much every page is gorgeously formatted. Knuth developed TeX in part to produce beautiful books, and that is on display here. Many thoughtful questions are provided as an aid to learning these very useful techniques. The Answers section runs for 303 pages. It will take me months or years to digest most the information in this work, but I can't imagine a better presentation for this difficult but lucratively useful material.
ebookfree-download.blogspot.com
{ 0 comments... Views All / Send Comment! }
Post a Comment