Facebook Twitter Pinterest
EUR 23,99
  • Alle Preisangaben inkl. USt
Gewöhnlich versandfertig in 2 bis 4 Wochen.
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
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


Alle 3 Formate und Ausgaben anzeigen Andere Formate und Ausgaben ausblenden
Preis
Neu ab Gebraucht ab
Taschenbuch
"Bitte wiederholen"
EUR 23,99
EUR 23,99 EUR 43,65
2 neu ab EUR 23,99 3 gebraucht ab EUR 43,65
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 66,97
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


Kundenrezensionen

Noch keine Kundenrezensionen vorhanden.
5 Sterne
0
4 Sterne
0
3 Sterne
0
2 Sterne
0
1 Stern
0
Sagen Sie Ihre Meinung zu diesem Artikel

Die hilfreichsten Kundenrezensionen auf Amazon.com

Amazon.com: 4,8 von 5 Sternen 10 Rezensionen
8 Personen fanden diese Informationen hilfreich.
5,0 von 5 SternenA fresh introduction to combinatorial thinking
am 3. Mai 2008 - Veröffentlicht auf Amazon.com
Verifizierter Kauf
5,0 von 5 SternenThe Art of Computer Programming -- Finally a new addition!
am 12. April 2014 - Veröffentlicht auf Amazon.com
Verifizierter Kauf
4,0 von 5 SternenMy Favorite Computer Science Author
am 3. Dezember 2015 - Veröffentlicht auf Amazon.com
Verifizierter Kauf
Eine Person fand diese Informationen hilfreich.
5,0 von 5 SternenTAOCP: Volume 4 - Fascicle 0
am 23. Juni 2008 - Veröffentlicht auf Amazon.com
Verifizierter Kauf
5,0 von 5 Sternen2014 Link Update...
am 12. Februar 2014 - Veröffentlicht auf Amazon.com
Verifizierter Kauf
Möchten Sie weitere Produkte entdecken? Weitere Informationen finden Sie auf dieser Seite: korallen aquarium

Wo ist meine Bestellung?

Versand & Rücknahme

Brauchen Sie Hilfe?