We see that javascript is disabled or not supported by your browser - javascript is needed for important actions on the site. Read more

What's New - Home - Login

Member $avings: $81,544,856.31 | Books Available: 800,374 | Members Online: 250

Swap Used Books - Buy New Books at Great Prices!

How To Swap Books Sign Up Search submenu

PBS Market (New Books)

Gift Buying Guide

Book Browser Advanced Search Books Posted Today Member Book Reviews Award Winning Books NYT Best Sellers Amazon Best Sellers Most Traveled Copies Club Wish List

Discussion Forums Book Lists

Club Lists My Book Lists My Watched Lists Create a List

Blog Donations

School Donation Program In Memory of... Military Donation Program Friends of PBS

Box-O-Books Maps The Eclectic Pen Fun Stuff

20 Questions Sudoku Bookmark Creator

Top 100

Requests Posts Swappers Referrers Reviewers

Pulse of PBS Spread The Word

Invite Friends Bookmarks Facebook Page Facebook App More Ways...

Photo Gallery Recipes Club Tag Cloud Member Testimonials

Help Center submenu

How To Swap Books Browse Help Docs Ask the Librarian PBS Member Icons Live Help

Kiosk

PBS Market (New Books) Go Shopping Buy Credits Buy PBS Money Upgrade Membership Gift Certificates Transfer Credits

Need Help?

Search - The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 (Series in Computer Science & Information Processing)

The Art of Computer Programming Volume 4A Combinatorial Algorithms Part 1 - Series in Computer Science & Information Processing
Author: Donald E. Knuth

Knuth?s multivolume analysis of algorithms is widely recognized as the definitive description of classical computer science. The first three volumes of this work have long comprised a unique and invaluable resource in programming theory and practice. Scientists have marveled at the beauty and elegance of Knuth?s analysis, while practicing progra... more »mmers have successfully applied his ?cookbook? solutions to their day-to-day problems. The level of these first three volumes has remained so high, and they have displayed so wide and deep a familiarity with the art of computer programming, that a sufficient ?review? of future volumes could almost be: ?Knuth, Volume n has been published.? ?Data Processing Digest Knuth, Volume n has been published, where n = 4A. In this long-awaited new volume, the old master turns his attention to some of his favorite topics in broadword computation and combinatorial generation (exhaustively listing fundamental combinatorial objects, such as permutations, partitions, and trees), as well as his more recent interests, such as binary decision diagrams. The hallmark qualities that distinguish his previous volumes are manifest here anew: detailed coverage of the basics, illustrated with well-chosen examples; occasional forays into more esoteric topics and problems at the frontiers of research; impeccable writing peppered with occasional bits of humor; extensive collections of exercises, all with solutions or helpful hints; a careful attention to history; implementations of many of the algorithms in his classic step-by-step form. There is an amazing amount of information on each page. Knuth has obviously thought long and hard about which topics and results are most central and important, and then, what are the most intuitive and succinct ways of presenting that material. Since the areas that he covers in this volume have exploded since he first envisioned writing about them, it is wonderful how he has managed to provide such thorough treatment in so few pages. ?Frank Ruskey, Department of Computer Science, University of Victoria The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for self-study, plus hundreds of useful facts that cannot be found in any other publication. Volume 4A surely belongs beside the first three volumes of this classic work in every serious programmer?s library.

ISBN-13: 9780201038040
ISBN-10: 0201038048
Publication Date: 1/24/2011
Pages: 912
Rating:

0 stars, based on 0 rating

Publisher: Addison-Wesley Professional
Book Type: Hardcover
Members Wishing: 1
Reviews: Amazon | Write a Review

Genres:

Back to the Top ↑

Search - The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 (Series in Computer Science & Information Processing)

Loading...