4458624

9780321335708

Art of Computer Programming, Fascicle 4 Generating All Trees -- History of Combinatorial Generation

Art of Computer Programming, Fascicle 4 Generating All Trees -- History of Combinatorial Generation
$33.27
$3.95 Shipping
  • Condition: New
  • Provider: Ergodebooks Contact
  • Provider Rating:
    82%
  • Ships From: Multiple Locations
  • Shipping: Standard
  • Comments: Buy with confidence. Excellent Customer Service & Return policy. Ships Fast. 24*7 Customer Service.

   30-day money back guarantee
$15.16
$3.95 Shipping
List Price
$19.99
Discount
24% Off
You Save
$4.83

  • Condition: Good
  • Provider: seattlegoodwill Contact
  • Provider Rating:
    95%
  • Ships From: Seattle, WA
  • Shipping: Standard
  • Comments: May have some shelf-wear due to normal use.

   30-day money back guarantee

Ask the provider about this item.

Most renters respond to questions in 48 hours or less.
The response will be emailed to you.
Cancel
  • ISBN-13: 9780321335708
  • ISBN: 0321335708
  • Edition: 1
  • Publication Date: 2006
  • Publisher: Addison Wesley Professional

AUTHOR

Knuth, Donald Ervin

SUMMARY

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 2 This 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.Knuth, Donald Ervin is the author of 'Art of Computer Programming, Fascicle 4 Generating All Trees -- History of Combinatorial Generation', published 2006 under ISBN 9780321335708 and ISBN 0321335708.

[read more]

Questions about purchases?

You can find lots of answers to common customer questions in our FAQs

View a detailed breakdown of our shipping prices

Learn about our return policy

Still need help? Feel free to contact us

View college textbooks by subject
and top textbooks for college

The ValoreBooks Guarantee

The ValoreBooks Guarantee

With our dedicated customer support team, 30-day no-questions-asked return policy, and our price match guarantee, you can rest easy knowing that we're doing everything we can to save you time, money, and stress.