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

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 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 :
Description
Résumé : 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
Variantes de titre : Introduction to combinatorial algorithms and boolean functions
Notes : La couv. porte la mention : "Newly available sections of the classic work"
Historique des publications : Autre tirage : 2009
Bibliographie : Index
ISBN : 978-0-321-53496-5
0-321-53496-4
978-0-321-63713-0