- Gebundene Ausgabe: 640 Seiten
- Sprache: Englisch
- ISBN-10: 0201038048
- ISBN-13: 978-0201038040
- Größe und/oder Gewicht: 24,2 x 17 x 4,9 cm
- Amazon Bestseller-Rang: Nr. 396.084 in Bücher (Siehe Top 100 in Bücher)
Produktinformation |
Mehr über den Autor
Entdecken Sie Bücher, lesen Sie über Autoren und mehr
› Besuchen Sie die Seite von Donald E. Knuth auf Amazon
› Besuchen Sie die Seite von Donald E. Knuth auf Amazon
Produktbeschreibungen
Synopsis
Details fundamental concepts and techniques of non-numerical analysis in computer programming, and discusses mathematical linguistics, language translation programming and basic, seminumerical, combinatorial, and syntactical algorithms.
Welche anderen Artikel kaufen Kunden, nachdem sie diesen Artikel angesehen haben?
Vorgeschlagene Tags zu ähnlichen Produkten(Was ist das?)Setzen Sie den ersten relevanten Tag hinzu (ein Schlüsselwort, das mit diesem Produkt in engem Zusammenhang steht).
|
Eine digitale Version dieses Buchs im Kindle-Shop verkaufen
Wenn Sie ein Verleger oder Autor sind und die digitalen Rechte an einem Buch haben, können Sie die digitale Version des Buchs in unserem Kindle-Shop verkaufen.
Weitere Informationen
Kundenrezensionen
Es gibt noch keine Kundenrezensionen auf Amazon.de
5 Sterne
4 Sterne
3 Sterne
2 Sterne
1 Sterne
Die hilfreichsten Kundenrezensionen auf Amazon.com (beta)
Amazon.com:
3 Rezensionen
33 von 38 Kunden fanden die folgende Rezension hilfreich
A gorgeous classic on Combinatorial thought
2. Februar 2011
Format:Gebundene Ausgabe|Von Amazon bestätigter Kauf
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.
16 von 20 Kunden fanden die folgende Rezension hilfreich
It was a long wait...
3. März 2011
Format:Gebundene Ausgabe|Von Amazon bestätigter Kauf
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?
1 von 1 Kunden fanden die folgende Rezension hilfreich
No review needed
5. März 2012
Format:Gebundene Ausgabe|Von Amazon bestätigter Kauf
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.
Waren diese Rezensionen hilfreich?
Wir wollen von Ihnen hören.
Kunden diskutieren
|
Das Forum zu diesem Produkt
Fragen stellen, Meinungen austauschen, Einblicke gewinnen
Kundendiskussionen durchsuchen
|
Ähnliche Foren
|
|||||||
Lieblingslisten
|
|
Ähnliche Artikel finden
Ihr Kommentar
Möchten Sie die Produktinformationen aktualisieren oder Feedback zu den Produktabbildungen geben?
