{"product_id":"art-of-computer-programming-the-combinatorial-algorithms-volume-4a-part-1-9780201038040","title":"Art of Computer Programming  The: Combinatorial Algorithms  Volume 4A  Part 1","description":"\u003cp\u003eThe Art of Computer Programming  Volume 4A: Combinatorial Algorithms  Part 1 Knuths 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 Knuths analysis  while practicing programmers 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 programmers library. Finally  after a wait of more than thirty-five years  the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1 - 4A in one elegant case  and offers the purchaser a $50 discount off the price of buying the four volumes individually. p The Art of Computer Programming  Volumes 1-4A Boxed Set  3\/e  ISBN: 0321751043\u003c\/p\u003e","brand":"My Store","offers":[{"title":"Default Title","offer_id":45651886637109,"sku":"ByrdShop_0201038048","price":75.1,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0627\/8139\/0901\/files\/9780201038040.jpg?v=1781843919","url":"https:\/\/atxbooks.com\/products\/art-of-computer-programming-the-combinatorial-algorithms-volume-4a-part-1-9780201038040","provider":"ATX Books","version":"1.0","type":"link"}