Books Home | About Us | Index | Next Record | Browse

The online computer book shop for UK & Europe                                   

Tel: 0121 706 6000 

Static Book Details Page - Computer Manuals Website

 Art of Computer Programming, Volume 4, Fascicle 3.
  

  Art of Computer Programming, Volume 4, Fascicle 3. by Donald E. Knuth

  • Published by: ADDISON-WESLEY
  • Author: Donald E. Knuth
  • Page Count: 150
  • Group: PROGRAMMERS REFERENCE BOOKS
  • ISBN: 0201853949 / 9780201853940
  • Published: Aug 2005

Our Price: 11.19
Discount: 20%
RRP: 13.99 

For Latest Pricing and Availability Click Here
 

The online computer book shop for UK & Europe

Book Information and Description:

Art of Computer Programming, Volume 4, Fascicle 3.
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 3

This fascicle continues Knuth's authoritative chapter on combinatorial algorithms, ultimately to be included in Volume 4 of The Art of Computer Programming. The previous fascicle from Volume 4, which covered the generation of all tuples and permutations, is now complemented by techniques for generating all combinations and partitions. In Knuth's thorough discussion of these two topics, readers will find much that is new, as well as surprisingly rich ties to material in Volumes 1 through 3 and to other aspects of computer science and mathematics. As usual, this fascicle includes a bounty of creative exercises, as well as intriguing challenges posed by yet-unsolved questions.

CONTENTS:

Chapter 7 Combinatorial Searching

7.2. Generating All Possibilities 0

7.2.1. Generating Basic Combinatorial Patterns 0

7.2.1.1. Generating all n-tuples 0

7.2.1.2. Generating all permutations 0

7.2.1.3. Generating all combinations 1

7.2.1.4. Generating all partitions 36

7.2.1.5. Generating all set partitions 61

Answers to Exercises 87Index and Glossary 144

 

Book store with some thing for everyone