The Art of Computer Programming - Volume 4 - Fascicle 2

Generating All Tuples and Permutations - New Available Sections of the Classic Work

Donald E. Knuth

128 pages, parution le 17/03/2005

Ajouter à une liste

Indisponible

Résumé

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

L'auteur - Donald E. Knuth

Donald E. Knuth est professeur émérite à l'université de Stanford, membre de l'Académie des sciences des États-Unis, titulaire de la Médaille des sciences et du Prix Turing. Auteur d'une centaine de publications, notamment The Art of Computer Programming en trois volumes dont la section "Préliminaires mathématiques" a inspiré ce livre, il est également le créateur des systèmes TEX et Metafont auxquels il a déjà consacré cinq ouvrages.

Sommaire

Combinatorial Searching
- Generating All Possibilities
Answers to Exercises
Index and Glossary

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Addison Wesley
Auteur(s)	Donald E. Knuth
Parution	17/03/2005
Nb. de pages	128
Format	16 x 24
Couverture	Broché
Poids	273g
Intérieur	Noir et Blanc
EAN13	9780201853933
ISBN13	978-0-201-85393-3