Hide this

Results from Google Books

Click on a thumbnail to go to Google Books.

The Art of Computer Programming, Volume 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions by Donald E. Knuth
Loading...

The Art of Computer Programming, Volume 4, Fascicle 0: Introduction to…

by Donald E. Knuth

Series: The Art of Computer Programming (volume 4, fascicle 0)

MembersReviewsPopularityAverage ratingConversations
20None277,789 (5)None
Loading...
won't like will probably not like will probably like will like will love

Sign up for LibraryThing to find out whether you'll like this book.

No reviews
no reviews | add a review
You must log in to edit Common Knowledge data.
For more help see the Common Knowledge help page.
Series (with order)
Canonical Title
Original publication date
People/Characters
Important places
Important events
Related movies
Awards and honors
Epigraph
Dedication
First words
Quotations
Last words
Disambiguation notice
Publisher's editors
Blurbers

References to this work on external resources.

Wikipedia in English (5)

Donald Knuth

Fisher–Yates shuffle

Majority function

Median algebra

The Art of Computer Programming

Book description

Amazon.com Product Description (ISBN 0321534964, Paperback)

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

(retrieved from Amazon Fri, 24 Apr 2009 07:57:52 -0400)

The first test round has been closed. Visit the Open Shelves Classification group for details.

Quick Links

Ebooks Audio Swap
0/14

Popular covers

 

Help/FAQs | About | Privacy/Terms | Blog | Contact | LibraryThing.com | APIs | WikiThing | Common Knowledge | 46,541,308 books!