The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1
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 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 programmer’s 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/eISBN: 0321751043
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Donald E. Knuth is known throughout the world for his pioneering work on algorithms and programming techniques, for his invention of the TEX and METAFONT systems for computer typesetting, and for his prolific and influential writing (26 books, 161 papers). Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of his seminal multivolume series on classical computer science, begun in 1962 when he was a graduate student at California Institute of Technology. Professor Knuth is the recipient of numerous awards and honors, including the ACM Turing Award, the Medal of Science presented by President Carter, the AMS Steele Prize for expository writing, and, in November, 1996, the prestigious Kyoto Prize for advanced technology. He lives on the Stanford campus with his wife, Jill.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 21,02 für den Versand von USA nach Deutschland
Versandziele, Kosten & DauerGratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerAnbieter: ThriftBooks-Atlanta, AUSTELL, GA, USA
Hardcover. Zustand: Very Good. No Jacket. Missing dust jacket; May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 3.3. Bestandsnummer des Verkäufers G0201038048I4N01
Anzahl: 1 verfügbar
Anbieter: Greener Books, London, Vereinigtes Königreich
Hardcover. Zustand: Used; Very Good. **SHIPPED FROM UK** We believe you will be completely satisfied with our quick and reliable service. All orders are dispatched as swiftly as possible! Buy with confidence! Greener Books. Bestandsnummer des Verkäufers 4836655
Anzahl: 1 verfügbar
Anbieter: SecondSale, Montgomery, IL, USA
Zustand: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc. Bestandsnummer des Verkäufers 00085821269
Anzahl: 1 verfügbar
Anbieter: St Vincent de Paul of Lane County, Eugene, OR, USA
Zustand: Good. >> hardcover 100% of proceeds go to charity! Good condition with all pages in tact. Item shows signs of use and may have cosmetic defects. Bestandsnummer des Verkäufers H-05-5031
Anzahl: 1 verfügbar
Anbieter: moluna, Greven, Deutschland
Zustand: New. 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. Scient. Bestandsnummer des Verkäufers 5897172
Anzahl: Mehr als 20 verfügbar
Anbieter: Anybook.com, Lincoln, Vereinigtes Königreich
Zustand: Good. Volume 4A. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. Dust jacket in good condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,1600grams, ISBN:9780201038040. Bestandsnummer des Verkäufers 5554767
Anzahl: 1 verfügbar
Anbieter: Friends of Pima County Public Library, Tucson, AZ, USA
Zustand: Good. Hardcover. NOT Ex-library. Good condition. Minor shelfwear to dust jacket. Slight edgewear and bumping. Clean pages and tight binding. Page edges lightly soiled. Until further notice, USPS Priority Mail only reliable option for Hawaii. Proceeds benefit the Pima County Public Library system, which serves Tucson and southern Arizona. G26. Bestandsnummer des Verkäufers 529WDE000D4B
Anzahl: 1 verfügbar
Anbieter: A Team Books, Conway, AR, USA
hardcover. Zustand: Good. Used books may not include access codes or one time use codes. Proven Seller with Excellent Customer Service. Choose expedited shipping and get it FAST. Bestandsnummer des Verkäufers sun0000029790
Anzahl: 1 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Hardcover. Zustand: Neu. Neu Neuware, Importqualität, auf Lager - 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 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 programmer's library. Bestandsnummer des Verkäufers INF1000774474
Anzahl: 1 verfügbar
Anbieter: Sharehousegoods, Colgate, WI, USA
Zustand: New. This is a brand new book! Fast Shipping - Safe and Secure Mailer - Our goal is to deliver a better item than what you are hoping for! If not we will make it right! Bestandsnummer des Verkäufers 1XGWPI000CK6
Anzahl: 1 verfügbar