• Alle Preisangaben inkl. MwSt.
Nur noch 2 auf Lager (mehr ist unterwegs).
Verkauf und Versand durch Amazon.
Geschenkverpackung verfügbar.
Menge:1
The Art of Computer Progr... ist in Ihrem Einkaufwagen hinzugefügt worden
+ EUR 3,00 Versandkosten
Gebraucht: Gut | Details
Verkauft von Deal DE
Zustand: Gebraucht: Gut
Kommentar: Dieses Buch ist in gutem, sauberen Zustand. Seiten und Einband sind intakt.
Ihren Artikel jetzt
eintauschen und
EUR 0,10 Gutschein erhalten.
Möchten Sie verkaufen?
Zur Rückseite klappen Zur Vorderseite klappen
Anhören Wird wiedergegeben... Angehalten   Sie hören eine Probe der Audible-Audioausgabe.
Weitere Informationen
Dieses Bild anzeigen

The Art of Computer Programming: Generating All Trees--History of Combinatorial Generation; Volume 4 (Englisch) Taschenbuch – 16. Februar 2006

1 Kundenrezension

Alle Formate und Ausgaben anzeigen Andere Formate und Ausgaben ausblenden
Amazon-Preis Neu ab Gebraucht ab
Taschenbuch
"Bitte wiederholen"
EUR 18,84
EUR 17,89 EUR 10,73
4 neu ab EUR 17,89 6 gebraucht ab EUR 10,73 1 Sammlerstück ab EUR 39,90

Hinweise und Aktionen

  • Große Hörbuch-Sommeraktion: Entdecken Sie unsere bunte Auswahl an reduzierten Hörbüchern für den Sommer. Hier klicken.


Wird oft zusammen gekauft

The Art of Computer Programming: Generating All Trees--History of Combinatorial Generation; Volume 4 + The Art of Computer Programming: Fascicle 2: Generating All Tuples and Permutations + The Art of Computer Programming, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions
Preis für alle drei: EUR 65,94

Die ausgewählten Artikel zusammen kaufen
Jeder kann Kindle Bücher lesen — selbst ohne ein Kindle-Gerät — mit der KOSTENFREIEN Kindle App für Smartphones, Tablets und Computer.


Große Hörbuch-Sommeraktion
Entdecken Sie unsere vielseitige Auswahl an reduzierten Hörbüchern aus den Bereichen Romane, Krimis & Thriller, Sachbuch und Kinder- & Jugendhörbücher. Klicken Sie hier, um direkt zur Aktion zu gelangen.

Produktinformation

  • Taschenbuch: 120 Seiten
  • Verlag: Addison Wesley Pub Co Inc; Auflage: 1 (16. Februar 2006)
  • Sprache: Englisch
  • ISBN-10: 0321335708
  • ISBN-13: 978-0321335708
  • Größe und/oder Gewicht: 16,3 x 0,9 x 24,1 cm
  • Durchschnittliche Kundenbewertung: 5.0 von 5 Sternen  Alle Rezensionen anzeigen (1 Kundenrezension)
  • Amazon Bestseller-Rang: Nr. 210.255 in Fremdsprachige Bücher (Siehe Top 100 in Fremdsprachige Bücher)
  • Komplettes Inhaltsverzeichnis ansehen

Mehr über den Autor

Entdecken Sie Bücher, lesen Sie über Autoren und mehr

Produktbeschreibungen

Synopsis

This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science.The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing 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. To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published at regular intervals. Each fascicle will encompass a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete.Volume 4, Fascicle 4 This latest fascicle covers the generation of all trees, a basic topic that has surprisingly rich ties to the first three volumes of The Art of Computer Programming.

In thoroughly discussing this well-known subject, while providing 124 new exercises, Knuth continues to build a firm foundation for programming. To that same end, this fascicle also covers the history of combinatorial generation. Spanning many centuries, across many parts of the world, Knuth tells a fascinating story of interest and relevance to every artful programmer, much of it never before told. The story even includes a touch of suspense: two problems that no one has yet been able to solve.

Über den Autor und weitere Mitwirkende

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. Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of these fascicles and the seven volumes to which they belong.

Kundenrezensionen

5.0 von 5 Sternen
5 Sterne
1
4 Sterne
0
3 Sterne
0
2 Sterne
0
1 Sterne
0
Siehe die Kundenrezension
Sagen Sie Ihre Meinung zu diesem Artikel

Die hilfreichsten Kundenrezensionen

2 von 2 Kunden fanden die folgende Rezension hilfreich Von ET am 17. April 2014
Format: Taschenbuch Verifizierter Kauf
Wichtig für alle, die nicht wie ich auf den Titel der Artikelbeschreibung hereinfallen wollen:

Es ist nicht das Volume 4 aus der bekannten, ich möchte fast sagen - legendären Reihe dieses begnadeten Informatikprofessors, es ist nur das Kapitel 7 "Combinatorial Searching" desselben, genauer gesagt: Kapitel 7.2 "Generating All Possibilities" und noch genauer eigentlich nur Abschnitt 7.2.1 "Generating Basic Combinatorial Patterns".

Ansonsten ein humorvoll geschriebenes Buch, man bekommt nach echter Knuth'schen Manier sogar US$ 2,56 für jeden Fehler, den man im Buch entdecken sollte und als erster berichtet, und US$ 0,32 für jeden Verbesserungsvorschlag. Jeder, der diese gar nicht runden Zahlen anschaut, kann diesen Informatiker förmlich schmunzeln sehen, während er das Vorwort schreibt.

Mit vielen Übungsbeispielen und Lösungen, und

- last but not least -

erstklassig vermitteltem mathematisch-informatischem Fachwissen.

Viel Spaß beim Lesen

Habe keine Sterne abgezogen, auch wenn es wenig Knuth für dafür viel Geld ist, weil die dürftige Beschreibung, welche zur Enttäuschung beim Auspacken geführt hat, ja eigentlich nur dem Verkäufer Amazon anzulasten ist.
Kommentar War diese Rezension für Sie hilfreich? Ja Nein Feedback senden...
Vielen Dank für Ihr Feedback. Wenn diese Rezension unangemessen ist, informieren Sie uns bitte darüber.
Wir konnten Ihre Stimmabgabe leider nicht speichern. Bitte erneut versuchen

Die hilfreichsten Kundenrezensionen auf Amazon.com (beta)

Amazon.com: 6 Rezensionen
9 von 9 Kunden fanden die folgende Rezension hilfreich
has a distinctive historical monograph 30. März 2006
Von W Boudville - Veröffentlicht auf Amazon.com
Format: Taschenbuch
This fascicle can perhaps best be read as a sequel to Knuth's Volume 3, on sorting and searching, where he discusses trees. The fascicle extends that into how does one generate every tree. Of the four fascicles thus published, this might be the skimpiest in terms of current mathematical knowledge. Though to a practising programmer, trees are a vital construct and the book could well have germane analysis. And, as with his other books in this series, there is a tough set problems that can be just as instructive and interesting as the text.

Still, to perhaps compensate for the thin length, the book contains a distinctive section on the history of combinatorial generation. Knuth delves into this subject while giving a deeper treatment of the maths than one would likely encounter in a popular text directed at a general audience. He cites the I Ching, as well as ancient Indian and Arab manuscripts. The I Ching is notable as it is still in print and likely to be familiar to many.

With the publication of this fascicle, the collective set of four would make a respectable book in its own right. However, Knuth is scarcely done yet. We can expect more fascicles, and soon, one might hope. And eventually, a hardcover.
2014 Link Update... 12. Februar 2014
Von Let's Compare Options Preptorial - Veröffentlicht auf Amazon.com
Format: Taschenbuch Verifizierter Kauf
You might be wondering if the fascicle series is still worth getting, given the whole series has now been updated in a single text here: The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1.

The answer is: it depends on whether you have a specific area of combinatorics you're interested in (example: Fascicle 0 is great for logic gates and hence circuit designers), or if you're interested in the entire area of combinatorics and all 5 fascicles (0-4).

All 5 are essentially covered in the 2011 book above, with some corrections and deletions. Don't be fooled by the "part 1" because this series can be confusing. Go to Dr. Knuth's website to see the entire map of current and planned volumes and editions, including this series in .pdf: just Google/Bing Knuth website art of programming and click on the dot cs dot faculty dot stanford link for the series.

As you'll see on the site, part 1 (if the Dr's health holds out) has now been expanded with additional draft fascicles, especially in the essentially uncovered area of stochastic combinatorics. Probability wasn't even applied to computational combinatorics yet in the 60's, so this is not a flaw in Doc Knuth's coverage! There is a 4B, 4C, 4D etc. planned, mostly expanding recursion, statistics and other new areas of combinatorics.

Great self study intro to everything computational complexity, as combinatorics greatly pushes the "big O" computing envelope, and the talented Doc Knuth even weighs in on P/NP. Many examples given with mem counts that are up to date. Areas not covered include parallel and objective/constraint combos, such as linear programming, but there are tons of dedicated texts on those out there. Nothing comes close to Dr. Knuth's approach, especially for self study, given the astonishing volume of problems and solutions included. In one form or another, must have for all programmers.
Five Stars 23. März 2015
Von JR Crombez, Ph.D. - Veröffentlicht auf Amazon.com
Format: Taschenbuch Verifizierter Kauf
good for math/comp sci people
1 von 3 Kunden fanden die folgende Rezension hilfreich
The best computer book published in 2006 8. Januar 2009
Von Charles Ashbacher - Veröffentlicht auf Amazon.com
Format: Taschenbuch
It can be convincingly argued that Knuth's three volumes The Art of Programming is the best reference set for computer science ever written. They top my list of required reference works; the only items that might be placed ahead of them are books such as complete listings of the values of Unicode characters. Even then, it would be very specific to the situation.

It would be very difficult to overstate the value of the tree data structure in computing. If you cannot program the creation and searching of trees, do yourself and your employer a favor and find another line of work. In this book, Knuth gives the history of how the many uses of trees arose in the history of human problem solving. Concise with just enough detail, it is well worth reading. He frequently uses algorithms expressed in stepwise notation to make his points.

However, the real value of this book is in the exercises at the end of the sections. Because so much of it was familiar to me, I was often skimming through the explanatory material. That strategy changed when I reached the exercises, they are extensive and really force you to think the matter through. An enormous amount of fundamental computer science is expressed in those 156 questions and detailed answers to all of the exercises are included at the end. Even though there is only approximately sixty pages of explanatory material in this book, it could be used as a semester long text in advanced programming.

If working with trees is part of your job description, then you are a fool if you don't buy this book, study it then keep it for a reference. It is that good and in my opinion, it is the best computer book published in 2006.

Published in the online Journal of Object Technology, reprinted with permission
11 von 20 Kunden fanden die folgende Rezension hilfreich
Great for comp sci and math majors... 30. April 2006
Von Thomas Duff - Veröffentlicht auf Amazon.com
Format: Taschenbuch
I've known about The Art of Computer Programming volumes by Donald E. Knuth for some time, but I've always avoided reviewing them for fear of not being able to do them justice. But after being contacted specifically by the publisher asking if I was interested in the latest - The Art of Computer Programming, Volume 4, Fascicle 4 : Generating All Trees--History of Combinatorial Generation - I decided to give it a try. For the right audience, this is really good stuff. But I can tell you that I'm not it...

Content:

Chapter 7 - Combinatorial Searching: 7.2 - Generating All Possibilities; 7.2.1 - Generating Basic Combinatorial Patterns; 7.2.1.1 - Generating all n-tuples; 7.2.1.2 - Generating all permutations; 7.2.1.3 - Generating all combinations; 7.2.1.4 - Generating all partitions; 7.2.1.5 - Generating all set partitions; 7.2.1.6 - Generating all trees; 7.2.1.7 - History and further references; Answers to Exercises; Index and Glossary

Don't refresh your browser thinking the Content section didn't load properly. There's just chapter 7... For those who don't understand the "fascicle" concept (like I didn't before getting this volume), it's a small book (120 pages) of material that either updates writings in previous volumes or a "preview" of material that will eventually be rolled into a single volume (in this case, volume 4). Knuth has a lot of information he wants to convey, and by using fascicles, the public can get a steady flow of information and help shape the continuing evolution of the series. Interesting concept, and one I can appreciate. Another review stated that this was probably one of the "skimpiest" volumes in terms of mathematical knowledge. If true, then I fear what will await me with future installments. To get the most of out Knuth's work, you really do need to be well-grounded in computer science and mathematical theory. Every page is populated with numerous formulas to prove the subject matter, and I'll admit to being completely lost in most of it. That doesn't mean the book isn't good. It *is* excellent work, but I'm definitely not the target audience. I don't come from a formal computer science and mathematics background, so I'd have to really slog through everything from page 1 with supporting texts in order to fully benefit from it.

It wasn't a total loss for me, though... I enjoyed the History and Further References chapter, where he shows the tree theory and how it affected such things as literature and culture through the ages. Whether the ancient Chinese had all this in mind when developing the I Ching is open to debate, but the theory and underpinnings of trees is definitely there. And for those readers who really want to work through and apply the material, there are exercises galore at the end (with answers graciously provided for those who get stuck). You could likely set up a college level course based on this (and associated) book, and it would be foundational to a computer science degree.

So, for the right audience, this is the type of book that will allow for weeks of thought and learning. But if you're more like me, someone who deals more with business systems and development (without a comp sci degree to back it up), you'll likely miss most of the value here.
Waren diese Rezensionen hilfreich? Wir wollen von Ihnen hören.