FREE SHIPPING

on all orders of $59 or more

$10 OFF your purchase of $150 or more!
Use coupon code MONDAY in checkout.

The Art of Computer Programming, Volume 4, Fascicle 0 Introduction to Combinatorial Algorithms and Boolean Functions

, by
The Art of Computer Programming, Volume 4, Fascicle 0 Introduction to Combinatorial Algorithms and Boolean Functions by Knuth, Donald E., 9780321534965
Note: Supplemental materials are not guaranteed with Rental or Used book purchases.
  • ISBN: 9780321534965 | 0321534964
  • Cover: Paperback
  • Copyright: 4/17/2008
  • Buy New Book

    Currently Available, Usually Ships in 24-48 Hours

    $20.81
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 t regular intervals. Each fascicle will encompass a section or more of wholly new or evised 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 2This fascicle inaugurates the eagerly awaited publication of Knuth's The Art of Computer Programming, Volume 4: Combinatorial Algorithms. Part of what will be a long chapter on combinatorial searching, the fascicle begins his treatment of how to generate all possibilities. Specifically, it discusses the generation of all n-tuples, then extends those ideas to all permutations. Such algorithms provide a natural motivation by means of which many of the key ideas of combinatorial mathematics can be introduced and explored. In this and other fascicles of Volume 4, Knuth illuminates important theories by discussing related games and puzzles. Even serious programming can be fun.

You might also enjoy...



Please wait while the item is added to your bag...