The Art of Computer Programming - Volume 4 - Fascicle 3

Generating All Combinations and Partitions

Donald E. Knuth

150 pages, parution le 19/12/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 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 3

This fascicle continues Knuth's authoritative chapter on combinatorial algorithms, ultimately to be included in Volume 4 of The Art of Computer Programming. The previous fascicle from Volume 4, which covered the generation of all tuples and permutations, is now complemented by techniques for generating all combinations and partitions. In Knuth's thorough discussion of these two topics, readers will find much that is new, as well as surprisingly rich ties to material in Volumes 1 through 3 and to other aspects of computer science and mathematics. As usual, this fascicle includes a bounty of creative exercises, as well as intriguing challenges posed by yet-unsolved questions.

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
- Generating basic combinatorial patterns
- Answers to exercises
- Index and glossary

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Addison Wesley
Auteur(s)	Donald E. Knuth
Parution	19/12/2005
Nb. de pages	150
Format	16 x 24
Couverture	Broché
Poids	304g
Intérieur	Noir et Blanc
EAN13	9780201853940
ISBN13	978-0-201-85394-0