Pearson New Releases, Software Engineering
Art of Computer Programming, Volume 4
Introduction to Combinatorial Algorithms and Boolean Functions
Author:
Knuth, Donald E.
Isbn 13:
9780321534965
ISBN: 0321534964
Pub Date:
Apr 18, 2008
Publisher:
Addison-Wesley
Shipping Weight: 0.96 pounds
Status:
Ships 1-5 days rush ship avail
Quantum Price: $16.99
Quantity in Basket: None
This fascicle introduces 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.
view
more info, including table of contents
(opens in pop-up window)