Facebook Twitter Pinterest
  • Alle Preisangaben inkl. USt
Auf Lager.
Verkauf und Versand durch Amazon. Geschenkverpackung verfügbar.
The Art of Computer Progr... ist in Ihrem Einkaufwagen hinzugefügt worden

Lieferort:
Um Adressen zu sehen, bitte
Oder
Bitte tragen Sie eine deutsche PLZ ein.
Oder
+ EUR 3,00 Versandkosten
Gebraucht: Sehr gut | Details
Verkauft von worldofbooksde
Zustand: Gebraucht: Sehr gut
Kommentar: The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.
Möchten Sie verkaufen?
Zur Rückseite klappen Zur Vorderseite klappen
Hörprobe Wird gespielt... Angehalten   Sie hören eine Hörprobe des Audible Hörbuch-Downloads.
Mehr erfahren
Alle 3 Bilder anzeigen

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

4,8 von 5 Sternen
5 Sterne
9
4 Sterne
1
3 Sterne
0
2 Sterne
0
1 Stern
0
4,8 von 5 Sternen 10 Rezensionen aus den USA.

Alle 2 Formate und Ausgaben anzeigen Andere Formate und Ausgaben ausblenden
Preis
Neu ab Gebraucht ab
Taschenbuch
"Bitte wiederholen"
EUR 24,49
EUR 18,12 EUR 16,76
8 neu ab EUR 18,12 3 gebraucht ab EUR 16,76
click to open popover

Wird oft zusammen gekauft

  • The Art of Computer Programming: Introduction to Combinatorial Algorithms and Boolean Functions
  • +
  • The Art of Computer Programming, Volume 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams
  • +
  • The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations
Gesamtpreis: EUR 67,47
Die ausgewählten Artikel zusammen kaufen

Es wird kein Kindle Gerät benötigt. Laden Sie eine der kostenlosen Kindle Apps herunter und beginnen Sie, Kindle-Bücher auf Ihrem Smartphone, Tablet und Computer zu lesen.

  • Apple
  • Android
  • Windows Phone

Geben Sie Ihre Mobiltelefonnummer ein, um die kostenfreie App zu beziehen.

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


Produktinformation

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 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.

Buchrückseite

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.

Alle Produktbeschreibungen

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

Kundenrezensionen

Es gibt noch keine Kundenrezensionen auf Amazon.de
5 Sterne
4 Sterne
3 Sterne
2 Sterne
1 Stern

Die hilfreichsten Kundenrezensionen auf Amazon.com (beta) (Kann Kundenrezensionen aus dem "Early Reviewer Rewards"-Programm beinhalten)

Amazon.com: 4.8 von 5 Sternen 10 Rezensionen
8 von 8 Kunden fanden die folgende Rezension hilfreich
5.0 von 5 Sternen 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.
5.0 von 5 Sternen The Art of Computer Programming -- Finally a new addition! 12. April 2014
Von Rick Tanney - Veröffentlicht auf Amazon.com
Format: Taschenbuch Verifizierter Kauf
Donald Knuth is the preeminent name in computer science for algorithm development and propagation. I have the first three volumes originally published years ago, and will continue getting his works as they become available. There is none better. This work is value to any programmer regardless of preferred language.
4.0 von 5 Sternen My Favorite Computer Science Author 3. Dezember 2015
Von JimmyNap - Veröffentlicht auf Amazon.com
Format: Taschenbuch Verifizierter Kauf
Donald Knuth is one of my favorite computer science authors. I hope that all of his published work remains available to the computer science community forever.
1 von 1 Kunden fanden die folgende Rezension hilfreich
5.0 von 5 Sternen 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.
0 von 1 Kunden fanden die folgende Rezension hilfreich
5.0 von 5 Sternen 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.
Waren diese Rezensionen hilfreich? Wir wollen von Ihnen hören.