Power Search
Low Price Guarantee
We Take School POs
The Art of Computer Programming, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions
Contributor(s): Knuth, Donald E. (Author)

View larger image

 ISBN: 0321534964     ISBN-13: 9780321534965
Publisher: Addison-Wesley Professional
OUR PRICE: $23.74  

Binding Type: Paperback
Published: May 2008
* Out of Print *

Annotation: To begin the fourth and later volume of the set, Knuth has created a series of small books called fascicles, which publish at regular intervals as they are ready. Each fascicle encompasses a section or more of wholly new material. Ultimately, the content of the fascicles will be rolled up into the comprehensive, final version of each volume.

Click for more in this series: Art of Computer Programming
Additional Information
BISAC Categories:
- Computers | Programming - General
Dewey: 005.1
Series: Art of Computer Programming
Physical Information: 0.59" H x 6.46" W x 9.36" L (0.96 lbs) 216 pages
Features: Glossary, Illustrated, Index, Price on Product, Price on Product - Canadian, Recycled Paper, Table of Contents
 
Descriptions, Reviews, Etc.
Publisher Description:
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 0
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 straightforwardprocedures 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.
 
Customer ReviewsSubmit your own review
 
To tell a friend about this book, you must Sign In First!