The art of computer programming : Volume 4, fascicle 3 Generating all combinations and partitions

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

Description complète

Enregistré dans:
Détails bibliographiques
Auteur principal : Knuth Donald Ervin (Auteur)
Format : Livre
Langue : anglais
Titre complet : The art of computer programming. Volume 4, fascicle 3, Generating all combinations and partitions / Donald E. Knuth,...
Publié : Upper Saddle River (N.J.) : Addison-Wesley , copyright 2005
Description matérielle : 1 vol. (V-150 p.)
Sujets :
LEADER 02620cam a2200565 4500
001 PPN090360982
003 http://www.sudoc.fr/090360982
005 20240528055200.0
010 |a 978-0-201-85394-0  |b br. 
010 |a 978-0-321-63713-0  |b éd. complète 
010 |a 0-201-85394-9  |b br. 
010 |a 0-321-63713-5  |b éd. complète 
035 |a (OCoLC)492447935 
073 1 |a 9780201853940 
100 |a 20050920h20052005k y0frey0103 ba 
101 0 |a eng 
102 |a US 
105 |a a a 001yy 
106 |a r 
181 |6 z01  |c txt  |2 rdacontent 
181 1 |6 z01  |a i#  |b xxxe## 
182 |6 z01  |c n  |2 rdamedia 
182 1 |6 z01  |a n 
183 1 |6 z01  |a nga  |2 rdacarrier 
200 1 |a The art of computer programming  |h Volume 4, fascicle 3  |i Generating all combinations and partitions  |f Donald E. Knuth,... 
210 |a Upper Saddle River (N.J.)  |c Addison-Wesley  |d copyright 2005 
215 |a 1 vol. (V-150 p.)  |c ill.  |d 25 cm 
300 |a La couv. porte la mention : "Newly available sections of the classic work" 
305 |a Autre tirage : 2009 
320 |a Notes bibliogr. Glossaire. Index 
330 |a 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 
517 | |a Generating all combinations and partitions 
606 |3 PPN027241378  |a Ordinateurs  |x Programmation  |2 rameau 
606 |3 PPN027282171  |a Algorithmes  |2 rameau 
686 |a 68W10  |c 2000  |2 msc 
686 |a 68R05  |c 2000  |2 msc 
686 |a 68-02  |c 2000  |2 msc 
686 |a 05-02  |c 2000  |2 msc 
686 |a 05A05  |c 2000  |2 msc 
686 |a 05A18  |c 2000  |2 msc 
686 |a F.2  |2 acm 
700 1 |3 PPN032581270  |a Knuth  |b Donald Ervin  |f 1938-....  |4 070 
801 3 |a FR  |b Abes  |c 20181023  |g AFNOR 
930 |5 441092105:251655350  |b 441092105  |j u 
930 |5 441092208:639555519  |b 441092208  |a 68C370  |j u 
915 |5 441092208:639555519  |b 18928 
979 |a CCFA 
991 |5 441092208:639555519  |a exemplaire créé automatiquement par l'ABES 
997 |a CCFA  |b 18928  |d CMB  |e BAP  |s d  |c 68C370 
998 |a 402326