• Alle Preisangaben inkl. MwSt.
Nur noch 6 auf Lager (mehr ist unterwegs).
Verkauf und Versand durch Amazon.
Geschenkverpackung verfügbar.
The Art of Computer Progr... ist in Ihrem Einkaufwagen hinzugefügt worden
Gebraucht: Gut | Details
Verkauft von Warehouse Deals
Zustand: Gebraucht: Gut
Kommentar: Schrumpffolie fehlt, Aktivierungscodes für Online-Bonusinhalte können fehlen bzw. abgelaufen sein. Mittlere Falte oder mittlerer Knick auf der Vorderseite. Mittlere Falte oder mittlerer Knick auf der Rückseite. Kleine Falte oder kleiner Knick am Buchrücken. Kleiner Fleck oder geringe Abnutzung auf den Seiten. Amazon-Kundenservice und Rücknahmegarantie (bis zu 30 Tagen) bei jedem Kauf.
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
Alle 3 Bilder anzeigen

The Art of Computer Programming, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions (Englisch) Taschenbuch – 17. April 2008

Alle Formate und Ausgaben anzeigen Andere Formate und Ausgaben ausblenden
Amazon-Preis Neu ab Gebraucht ab
"Bitte wiederholen"
EUR 24,59
EUR 21,58 EUR 3,46
6 neu ab EUR 21,58 5 gebraucht ab EUR 3,46

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, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions + The Art of Computer Programming + The Art of Computer Programming: Fascicle 2: Generating All Tuples and Permutations
Preis für alle drei: EUR 63,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.


Mehr über den Autor

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



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 0 This fascicle introduces what will become by far the longest chapter in The Art of Computer Programming, a chapter on combinatorial algorithms that will itself fill three full-sized volumes.

Combinatorial algorithms, informally, are techniques for the high-speed manipulation of extremely large quantities of objects, such as permutations or the elements of graphs. Combinatorial patterns or arrangements solve vast numbers of practical problems, and modern approaches to dealing with them often lead to methods that are more than a thousand times faster than the straightforward procedures of yesteryear. This fascicle primes the pump for everything that follows in the chapter, discussing first the essential ideas of combinatorics and then introducing fundamental ideas for dealing efficiently with 0s and 1s inside a machine, including Boolean basics and Boolean function evaluation. As always, the author's exposition is enhanced by hundreds of new exercises, arranged carefully for self-instruction, together with detailed answers.

Ü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 his time to the completion of these fascicles and the seven volumes to which they belong.

Welche anderen Artikel kaufen Kunden, nachdem sie diesen Artikel angesehen haben?


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: 9 Rezensionen
7 von 7 Kunden fanden die folgende Rezension hilfreich
A fresh introduction to combinatorial thinking 3. Mai 2008
Von Roozbeh Pournader - Veröffentlicht auf Amazon.com
Format: Taschenbuch Verifizierter Kauf
For those interested in combinatorial thinking, ranging from combinatorial card game puzzles to how to count the number of ways to do something, this is a great re-introduction. In this first part of the long-awaited Volume 4, Knuth tells you why he loves combinatorics and computer algorithms, and why it took him so long to publish volume 4.

Hearing it from Knuth, the fascicle basically reassured me in my personal dance with mathematics and algorithmics: there is no problem if you love these things!

I highly recommended this to few friends who were computer science students, and they really liked it. They could not stop reading it during a party at our home!

Disclaimer: This review is based on the preview version that was made available on Knuth's home page. I believe not much is changed, except that some errors should be corrected.
6 von 6 Kunden fanden die folgende Rezension hilfreich
the richness of Boolean functions 17. Mai 2008
Von W Boudville - Veröffentlicht auf Amazon.com
Format: Taschenbuch
Nobody should read this book lightly. It continues the decades-long practice of Knuth's series, by furnishing a huge set of exercises in the computational field. Yet ones where the emphasis is not on writing computer programs, though he does have some problems where you are asked to do this. Instead, you have to nut out puzzles in what you might term applied number theory. A key trait of the book, and of the entire series, is that the reduction of an algorithm to source code is a relatively minor aspect.

The book differs from the first 3 volumes in the surfeit of problems. Perhaps in part because decades have elapsed since those volumes came out. During which, Knuth accrued ever more problems that he now gives us.

The focus of this book on Boolean functions can be an eye opener to some readers. You might think, naively, how difficult could the theory of Boolean functions be? Knuth shows that there is a vast level of complexity and conceptual richness lurking in such apparently simple functions. The typical computer science text that mentions Boolean functions might devote some space to examples of these. But it rarely goes deeper than explaining how to optimise, say, ORs of ANDs, where this is used for in turn optimising circuit layouts on a chip. Knuth goes way beyond this.

Granted, those are introductory CS texts, and this is not. But the average computer programmer or chip designer rarely goes beyond those in mathematical depth. And so is unlikely to have seen the material in this book.
1 von 1 Kunden fanden die folgende Rezension hilfreich
TAOCP: Volume 4 - Fascicle 0 23. Juni 2008
Von dimis - Veröffentlicht auf Amazon.com
Format: Taschenbuch Verifizierter Kauf
I bought this book after a class I had in "Boolean Functions" and I must admit that the content was superb. Many interesting subjects about boolean functions, an extensive range of problems with solutions, and certainly a great deal of "food for thought" for further applications or research. All in all, a highly recommended book, and I am only wondering why volume 4 is not published in its final version (assuming that the rest of fascicles are in the same form). If you are interested in the field, just buy it.
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.
1 von 1 Kunden fanden die folgende Rezension hilfreich
Clarity and insight 5. Januar 2013
Von Davi - Veröffentlicht auf Amazon.com
Format: Taschenbuch Verifizierter Kauf
Knuth swims in Math and computer logic much as a fish does in water. Enter his mind, and you will become a legendary computer scientist, just like him.
Waren diese Rezensionen hilfreich? Wir wollen von Ihnen hören.