oder
Loggen Sie sich ein, um 1-Click® einzuschalten.
 
 
Alle Angebote
93 Angebote ab EUR 8,17

Möchten Sie verkaufen?
Hier verkaufen
 
   
The Art of Computer Programming Vol. 4 Fascicle 2: Generating All Tuples and Permutations
 
Größeres Bild
 

The Art of Computer Programming Vol. 4 Fascicle 2: Generating All Tuples and Permutations (Taschenbuch)

von Donald Ervin Knuth (Autor)
Noch keine Kundenrezensionen vorhanden: Schreiben Sie die erste!
Statt: EUR 13,99
Jetzt: EUR 13,95 Kostenlose Lieferung. Siehe Details.
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Auf Lager.
Verkauf und Versand durch Amazon.de. Geschenkverpackung verfügbar.

Noch 4 Stück auf Lager.

Lieferung bis Dienstag, 24. November: Wählen Sie an der Kasse Overnight-Express. Siehe Details.
84 neu ab EUR 8,17 9 gebraucht ab EUR 12,50
Amazon Kindle
Amazon Kindle - Jetzt internationaler Versand aus den USA
Entdecken Sie über 250.000 englischsprachige Bücher, Zeitungen und Zeitschriften. Mehr erfahren und bestellen bei Amazon.com in den USA.

Wird oft zusammen gekauft

The Art of Computer Programming Vol. 4 Fascicle 2: Generating All Tuples and Permutations + The Art of Computer Programming Vol. 4, Fascicle 3: Generating All Combinations and Partitions + The Art of Computer Programming 4. Fascicle 4: Generating All Trees - History of Combinatorial Generation
Preis für alle drei: EUR 44,85

Verfügbarkeit und Versanddetails anzeigen


Kunden, die diesen Artikel gekauft haben, kauften auch

The Art of Computer Programming Vol. 4, Fascicle 3: Generating All Combinations and Partitions

The Art of Computer Programming Vol. 4, Fascicle 3: Generating All Combinations and Partitions

von Donald Ervin Knuth
EUR 13,95
The Art of Computer Programming 4. Fascicle 4: Generating All Trees - History of Combinatorial Generation

The Art of Computer Programming 4. Fascicle 4: Generating All Trees - History of Combinatorial Generation

von Donald Knuth
EUR 16,95
The Art of Computer Programming Vol. 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions

The Art of Computer Programming Vol. 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions

von Donald E. Knuth
EUR 15,95
The Art of Computer Programming, Volume 4, Fascicle 1: Bitwise Tricks and Techniques; Binary Decision Diagrams

The Art of Computer Programming, Volume 4, Fascicle 1: Bitwise Tricks and Techniques; Binary Decision Diagrams

von Donald E. Knuth
EUR 13,95
The Art of Computer Programming Vol.1 Fascicle 1. MMIX - A RISC Computer for the New Millennium

The Art of Computer Programming Vol.1 Fascicle 1. MMIX - A RISC Computer for the New Millennium

von Donald E. Knuth
5.0 von 5 Sternen (1)  EUR 14,93
Weitere Artikel entdecken

Produktinformation


Produktbeschreibungen

Kurzbeschreibung

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 t regular intervals. Each fascicle will encompass a section or more of wholly new or evised 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 2 This fascicle inaugurates the eagerly awaited publication of Knuth's The Art of Computer Programming, Volume 4: Combinatorial Algorithms. Part of what will be a long chapter on combinatorial searching, the fascicle begins his treatment of how to generate all possibilities. Specifically, it discusses the generation of all n-tuples, then extends those ideas to all permutations. Such algorithms provide a natural motivation by means of which many of the key ideas of combinatorial mathematics can be introduced and explored. In this and other fascicles of Volume 4, Knuth illuminates important theories by discussing related games and puzzles. Even serious programming can be fun.


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 t regular intervals. Each fascicle will encompass a section or more of wholly new or evised 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 2 This fascicle inaugurates the eagerly awaited publication of Knuth's The Art of Computer Programming, Volume 4: Combinatorial Algorithms.

Part of what will be a long chapter on combinatorial searching, the fascicle begins his treatment of how to generate all possibilities. Specifically, it discusses the generation of all n-tuples, then extends those ideas to all permutations. Such algorithms provide a natural motivation by means of which many of the key ideas of combinatorial mathematics can be introduced and explored. In this and other fascicles of Volume 4, Knuth illuminates important theories by discussing related games and puzzles. Even serious programming can be fun.



Tags, die Kunden mit diesem Produkt verbinden

 (Was ist das?)
Klicken Sie zum Suchen verwandter Artikel, Diskussionen oder Personen auf ein Tag.
 
(1)

 

Kundenrezensionen


Noch keine Kundenrezensionen vorhanden.
Videorezensionen
Videorezensionen
Drehen Sie mit Ihrer Webcam Ihre eigene Video-Rezension zu diesem Artikel und laden Sie sie bei Amazon.de hoch.



Kunden diskutieren

Das Forum zu diesem Produkt
Diskussion Antworten Jüngster Beitrag
Noch keine Diskussionen

Fragen stellen. Meinungen austauschen. Neues erfahren.
Neue Diskussion starten
Thema:
Erster Beitrag:
Eingabe des Log-ins
 


Aktive Diskussionen in ähnlichen Foren
   
Ähnliche Foren


Lieblingslisten


Ähnliche Artikel finden


Anhand des Sachgebietes nach ähnlichen Produkten suchen:


Ihr Kommentar


Für Sie dokumentiert

 (Was ist das?)

Sobald Sie sich Produktseiten oder Suchergebnisse angesehen haben, finden Sie diese Seiten zu Ihrer Information hier aufgeführt.