Spesso comprati insieme
Dettagli prodotto
|
Vendi la versione digitale di questo libro nel Kindle Store
Se sei un editore o un autore e detieni i diritti digitali di un libro, puoi vendere la versione elettronica nel Kindle Store.
Maggiori informazioni
Quali altri articoli acquistano i clienti, dopo aver visualizzato questo articolo?
Recensioni clienti
Non ci sono ancora recensioni di clienti su Amazon.it
5 stelle
4 stelle
3 stelle
2 stelle
1 stella
Le recensioni clienti più utili su Amazon.com (beta)
Amazon.com:
5.0 su 5 stelle
4 recensioni
42 di 48 persone hanno trovato utile la seguente recensione
5.0 su 5 stelle
A gorgeous classic on Combinatorial thought
2 febbraio 2011
Di Ed Pegg
- Pubblicato su Amazon.com
Formato:Rilegato|Acquisto verificato Amazon
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.
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.
17 di 22 persone hanno trovato utile la seguente recensione
5.0 su 5 stelle
It was a long wait...
3 marzo 2011
Di Scott in LA
- Pubblicato su Amazon.com
Formato:Rilegato|Acquisto verificato Amazon
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?
3 di 5 persone hanno trovato utile la seguente recensione
5.0 su 5 stelle
No review needed
5 marzo 2012
Di Allyn Rothman
- Pubblicato su Amazon.com
Formato:Rilegato|Acquisto verificato Amazon
For anyone who has the first three volumes of "The Art of Computer Programming", a review of the fourth is completely unnecessary. If you don't yet own the first three, buy the whole set of four at a significant discount. More than half of the 900 pages is "Answers to Exercises", whose coverage of the topic is encyclopedic. If you want to know what Dr. Knuth has been doing the last 30 years, here is the answer. What is amazing is that this volume, number 4A, is evidently a prelude for more to come.
›
Vai su Amazon.com per consultare tutte le 4 recensioni
5.0 su 5 stelle
