<< 1 >>
Rating: 
Summary: Knuth is Analysis of Algorithms
Review: Befor Donald Ervin Knuth, there was no such thing as the Analysis of Algorithms. He is a visionary in this field, and these selected papers are a testomony to his greatness in this field.
Rating:
Summary: Knuth is Analysis of Algorithms
Review: Befor Donald Ervin Knuth, there was no such thing as the Analysis of Algorithms. He is a visionary in this field, and these selected papers are a testomony to his greatness in this field.
Rating:
Summary: Reference manual of it Analyzes of Algorithms
Review: Donald Knuth is recognized as guru of the science of the computation. This publication comes to already complement its collection consecrated. The Analysis of Algorithms is one of the most important areas of the science of the computation. Excellent release.
Rating:
Summary: Select Papers on the Analysis of Algorithms
Review: Donald Knuth is recognized as guru of the science of the computation. This publication comes to already complement its collection consecrated. The Analysis of Algorithms is one of the most important areas of the science of the computation. Excellent release.
Rating:
Summary: Knuth++
Review: Professor Knuth collects a charming and valuable set of papers into one terrific place. Don't miss his satirical "anti- Science" article "The Dangers of Computer Science", Chapter two, first presented in 1971.
Rating:
Summary: Knuth++
Review: Professor Knuth collects a charming and valuable set of papers into one terrific place. Don't miss his satirical "anti- Science" article "The Dangers of Computer Science", Chapter two, first presented in 1971.
Rating: 
Summary: Not as Approachable as Knuth's Other Writings
Review: To a reader interested in the analysis of algorithms, this book doubtlessly contains a number of very thorough analyses, with some interesting correspondence about the origin of complexity O()-notation and the term "NP-hard" thrown in.As a reader more interested in Knuth's work in general, I must admit that, despite having advanced degrees in CS and a quite decent math education, I found myself unable to follow the heavy mathematics employed, and ultimately, the problems analyzed were not interesting enough to me to make me spend the effort to follow it. One of the chapters was titled "A Trivial Algorithm Whose Analysis Isn't", and this probably sums up why I'm not entirely enthusiastic about this book and about the field of algorithm analysis in general. Knuth wouldn't be Knuth if he didn't throw some lighter material in as well, and chapter 2, "The Dangers of Computer Science Theory", was quite amusing.
Rating:
Summary: Not as Approachable as Knuth's Other Writings
Review: To a reader interested in the analysis of algorithms, this book doubtlessly contains a number of very thorough analyses, with some interesting correspondence about the origin of complexity O()-notation and the term "NP-hard" thrown in. As a reader more interested in Knuth's work in general, I must admit that, despite having advanced degrees in CS and a quite decent math education, I found myself unable to follow the heavy mathematics employed, and ultimately, the problems analyzed were not interesting enough to me to make me spend the effort to follow it. One of the chapters was titled "A Trivial Algorithm Whose Analysis Isn't", and this probably sums up why I'm not entirely enthusiastic about this book and about the field of algorithm analysis in general. Knuth wouldn't be Knuth if he didn't throw some lighter material in as well, and chapter 2, "The Dangers of Computer Science Theory", was quite amusing.
<< 1 >>
| 
