The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1
The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1
The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1
Price: $51.27 FREE for Members
Type: eBook
Released: 2011
Publisher: Addison-Wesley Professional
Page Count: 901
Format: pdf
Language: English
ISBN-10: 0201038048
ISBN-13: 9780201038040
User Rating: 5.0000 out of 5 Stars! (2 Votes)

About the Author

Donald E. Knuth is known throughout the world for his pioneering work on algorithms and programming techniques, for his invention of the TEX and METAFONT systems for computer typesetting, and for his prolific and influential writing (26 books, 161 papers). Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of his seminal multivolume series on classical computer science, begun in 1962 when he was a graduate student at California Institute of Technology. Professor Knuth is the recipient of numerous awards and honors, including the ACM Turing Award, the Medal of Science presented by President Carter, the AMS Steele Prize for expository writing, and, in November, 1996, the prestigious Kyoto Prize for advanced technology. He lives on the Stanford campus with his wife, Jill.





Tags:
Download The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 free ebook pdf djvu epub Read The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 online book The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 cheap ebook for kindle and nook The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 download book ebooks Donald E. Knuth The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 download pdf rapidshare mediafire fileserve 4shared torrent
Scott in LA (Los Angeles, USA) | 5 out of 5 Stars!
02/03/2011

Over 30 years, whew! I'm very pleased to be able to add this volume to the other three (I've had to replace volumes 1 and 3 because I wore out my first copies). And, I'm very glad I don't have to complete a graduate course that would use this volume as a text, I'm not sure I'd have the stamina to make it though. Thank you, Dr. Knuth, for your guidance and challenges. They certainly made a significant difference in the success of my career. I'm sure that those of you who delve into this volume will be enlightened by it as well. I'm not qualified to technically critique or perhaps even understand a lot of the material in this book, but at least I'll have the rest of my life to try. Now, doesn't he still owe us one more?

Ed Pegg Math puzzler (Champaign) | 5 out of 5 Stars!
02/02/2011

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 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.

Write Review

Your Name:

Your Review: Note: HTML is not translated!

Rating: Bad            Good

Enter the code in the box below: