Buy this book with Concrete Mathematics: Foundation for Computer Science by Ronald L. Graham today!

Buy Together Today: £109.28

Concrete Mathematics: Foundation for Computer Science by Ronald L. Graham  (5)  £47.49

Introduction to Algorithms by TH Cormen  (32)  £37.00

The Art of Computer Programming, Volume 4, Fascicle 4 - Generating All Trees - History of Combinatorial Generation by Donald E. Knuth £8.99

The Art of Computer Programming, Volume 4, Fascicle 3 - Generating All Combinations and Partitions by Donald E. Knuth £11.19

The Art of Computer Programming, Volume 4, Fascicle 2 - Generating All Tuples and Permutations by Donald E. Knuth £8.79

› Explore similar items : Books (49)

Book Description
Knuth's multivolume work, widely recognized as the definitive description of classical computer science, is now available in an attractive, boxed set. 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.

See descriptions of each individual volume for more information.

Synopsis
This multivolume work is widely recognized as the definitive description of classical computer science. The first three volumes have for decades been an invaluable resource in programming theory and practice for students, researchers, and practitioners alike. The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming. -Byte, September 1995 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. I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home...and even at a Little League game when my son wasn't in the line-up. -Charles Long Primarily written as a reference, some people have nevertheless found it possible and interesting to read each volume from beginning to end.A programmer in China even compared the experience to reading a poem.

If you think you're a really good programmer...read [Knuth's] Art of Computer Programming...You should definitely send me a resume if you can read the whole thing. -Bill Gates Whatever your background, if you need to do any serious computer programming, you will find your own good reason to make each volume in this series a readily accessible part of your scholarly or professional library. It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. -Jonathan Laventhol For the first time in more than 20 years, Knuth has revised all three books to reflect more recent developments in the field. His revisions focus specifically on those areas where knowledge has converged since publication of the last editions, on problems that have been solved, on problems that have changed. In keeping with the authoritative character of these books, all historical information about previous work in the field has been updated where necessary.Consistent with the author's reputation for painstaking perfection, the rare technical errors in his work, discovered by perceptive and demanding readers, have all been corrected.

Hundreds of new exercises have been added to raise new challenges. 0201485419B04062001

See all Product Description

The Art of Computer Programming Volume 1 Fascicle 1 MMIX A RISC Computer for the New Millennium by Donald E. Knuth £6.99

The Art of Computer Programming: Introduction to Combinatorial Algorithms and Boolean Functions: Fascicle 0 v. 4 (Art of Computer Programming) by Donald E. Knuth £11.19

The Art of Computer Programming: Fundamental Algorithms v. 1 (Art of Computer Programming) by Donald E. Knuth  (18)  £37.59

Concrete Mathematics: Foundation for Computer Science by Ronald L. Graham  (5)  £47.49

Things a Computer Scientist Rarely Talks About (CSLI Lecture Notes) by DE Knuth £13.50

› Explore similar items : Books (44)

9 Reviews 5 star:  (6) 4 star:  (2) 3 star:    (0) 2 star:  (1) 1 star:    (0)           Average Customer Review (9 customer reviews)		Share your thoughts with other customers:
Most Helpful Customer Reviews   4 of 4 people found the following review helpful: Well, it's Knuth, 25 Mar 1998 By A Customer This review is from: The Art of Computer Programming: Seminumerical Algorithms v. 2 (Hardcover) These volumes are considered first-class references on the subject of computing and algorithms. And they are... but these aren't really books to read. Nobody has time for that. However, for those computer scientists that really are hard up for something to read one of those rainy nights, Knuth has a personal flair and humor that spills into his algorithm summaries and exercises that is unsurpassed, at least in the field of CS handbooks. An excellent source for solutions to commonly asked questions and problems.  Comment | Permalink | Was this review helpful to you? (Report this)   14 of 17 people found the following review helpful: Can we shave a constant off this running time?, 3 April 1998 By A Customer This review is from: The Art of Computer Programming: Seminumerical Algorithms v. 2 (Hardcover) To an ordinary computer scienist, an algorithm is polynomial-time. To Knuth, it takes 3*n^2 + 17*x + 5 steps on MIX, not counting the time required to display the output, but there might be a way to reduce the number of steps to 3*n^2 + 17*x + 4. For precision and rigor, the Art of Computer Programming books are hard to beat. But, at least for an undergraduate CS student like me, they are slow going. Their greatest value seems to be as a reference for mathematical ideas needed in analysis of algorithms: recurrence relations, combinatorial identities, etc. Like the Bible, the TAOCP books are good to have around even if you don't plan to read them.  Comment | Permalink | Was this review helpful to you? (Report this)   3 of 3 people found the following review helpful: Difficult book, great source for exercises., 1 April 1998 By A Customer This review is from: The Art of Computer Programming: Seminumerical Algorithms v. 2 (Hardcover) Knuth's presentation is obscure and difficult, but he's awfully comprehensive. If you want to learn algorithms, or even if you're looking for a reference, there are many better choices (especially Introduction to Algorithms, the CLR book). That said, I can't point to a more thorough book. Among other things, The Art of Computer Programming series is a great source of problems if you're teaching, learning, or just looking for fun. It might be worth the price just for that.  Comment | Permalink | Was this review helpful to you? (Report this)