Nantilus
The art of computer programming : Volume 4, fascicle 0 Introduction to combinatorial algorithms and Boolean functions
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 quant...
Enregistré dans:
| Auteur principal : | |
|---|---|
| Format : | Livre |
| Langue : | anglais |
| Titre complet : | The art of computer programming. Volume 4, fascicle 0, Introduction to combinatorial algorithms and Boolean functions / Donald E. Knuth,... |
| Publié : |
Upper Saddle River (N.J.) :
Addison-Wesley
, cop. 2008 |
| Description matérielle : | 1 vol. (XI-216 p.) |
| Sujets : |
| LEADER | 02653cam a2200457 4500 | ||
|---|---|---|---|
| 001 | PPN132267896 | ||
| 003 | http://www.sudoc.fr/132267896 | ||
| 005 | 20240528055200.0 | ||
| 010 | |a 978-0-321-53496-5 |b br. | ||
| 010 | |a 0-321-53496-4 |b br. | ||
| 010 | |a 978-0-321-63713-0 |b éd. complète | ||
| 035 | |a (OCoLC)494916209 | ||
| 073 | 1 | |a 9780321534965 | |
| 100 | |a 20090325h20082008k 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 | |
| 200 | 1 | |a The art of computer programming |h Volume 4, fascicle 0 |i Introduction to combinatorial algorithms and Boolean functions |f Donald E. Knuth,... | |
| 210 | |a Upper Saddle River (N.J.) |c Addison-Wesley |d cop. 2008 | ||
| 215 | |a 1 vol. (XI-216 p.) |c ill. |d 24 cm | ||
| 305 | |a Autre tirage : 2009 | ||
| 312 | |a La couv. porte la mention : "Newly available sections of the classic work" | ||
| 320 | |a Index | ||
| 330 | |a 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 | ||
| 517 | | | |a Introduction to combinatorial algorithms and boolean functions | |
| 606 | |3 PPN027241378 |a Ordinateurs |x Programmation |2 rameau | ||
| 606 | |3 PPN027282171 |a Algorithmes |2 rameau | ||
| 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 20150630 |g AFNOR | |
| 915 | |5 441092208:639555349 |b 18925 | ||
| 930 | |5 441092208:639555349 |b 441092208 |a 68C367 |j u | ||
| 979 | |a CCFA | ||
| 991 | |5 441092208:639555349 |a exemplaire créé automatiquement par l'ABES | ||
| 997 | |a CCFA |b 18925 |d CMB |e BAP |s d |c 68C367 | ||
| 998 | |a 849203 | ||