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. The Art of Computer Programming, Volumes 1-4A Boxed Set, 3/e ISBN: 0321751043

*Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.*

EUR 17,48

**Spese di spedizione:**
EUR 3,67

In U.S.A.

Editore:
PEARSON EDUCATION

ISBN 10: 0201038048
ISBN 13: 9780201038040

Nuovi
PaperBack
Quantità: 10

Da

Valutazione libreria

**Descrizione libro **PEARSON EDUCATION. PaperBack. Condizione libro: Brand New. International Edition. International Edition, Cover & ISBN may be different from US edition, PAPERBACK. Book Condition: New. Brand New,Softcover,No Access code & No context dvd, But Contents are same as US Edition. Printed in English Language, Prompt shipping by USPS/,UPS/,DHL/,FedEx. Exceptional customer Service, Satisfaction Guaranteed. We may ship the books from Asian regions for inventory purpose. "Special Note" We do provide service on APO BOX & PO BOX addresses only in usa. Codice libro della libreria Aaddi22201

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

ISBN 10: 0201038048
ISBN 13: 9780201038040

Nuovi
Quantità: 5

Da

Valutazione libreria

**Descrizione libro **Condizione libro: New. New. Soft Cover International edition. Different ISBN and Cover image but contents are same as US edition.Perfect condition. Ship by express service to USA, Canada, Australia, France, Italy, UK, Germany and Netherland. Customer satisfaction our priority. Codice libro della libreria ABE-190516-124297

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

ISBN 10: 0201038048
ISBN 13: 9780201038040

Nuovi
Quantità: 5

Da

Valutazione libreria

**Descrizione libro **Condizione libro: Brand New. New. Soft Cover International edition. Different ISBN and Cover image but contents are same as US edition. Customer Satisfaction guaranteed!!. Codice libro della libreria SHAK124297

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

ISBN 10: 0201038048
ISBN 13: 9780201038040

Nuovi
Soft cover
Quantità: > 20

Da

Valutazione libreria

**Descrizione libro **2011. Soft cover. Condizione libro: New. This book is BRAND NEW Soft cover International edition with black and white printing. ISBN number & cover page may be different but contents identical to the US edition word by word. Book is in English language. Codice libro della libreria UN-PEA-ON-655

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

ISBN 10: 0201038048
ISBN 13: 9780201038040

Nuovi
Paperback
Quantità: 1

Da

Valutazione libreria

**Descrizione libro **Paperback. Condizione libro: New. New Softcover International Edition, Printed in Black and White, Only USPS Media mail Shipping ONLY, Different ISBN, Same Content As US edition, Book Cover may be Different, in English Language. Codice libro della libreria 15577

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Editore:
Pearson Education (US), United States
(2011)

ISBN 10: 0201038048
ISBN 13: 9780201038040

Nuovi
Rilegato
Quantità: 10

Da

Valutazione libreria

**Descrizione libro **Pearson Education (US), United States, 2011. Hardback. Condizione libro: New. 235 x 162 mm. Language: English . Brand New Book. 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. Codice libro della libreria AAK9780201038040

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Editore:
Pearson Education (US), United States
(2011)

ISBN 10: 0201038048
ISBN 13: 9780201038040

Nuovi
Rilegato
Quantità: 10

Da

Valutazione libreria

**Descrizione libro **Pearson Education (US), United States, 2011. Hardback. Condizione libro: New. 235 x 162 mm. Language: English . Brand New Book. 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. Codice libro della libreria AAK9780201038040

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Editore:
Prentice Hall

ISBN 10: 0201038048
ISBN 13: 9780201038040

Nuovi
Quantità: > 20

Da

Valutazione libreria

**Descrizione libro **Prentice Hall. Condizione libro: New. Brand New. Codice libro della libreria 0201038048

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

ISBN 10: 0201038048
ISBN 13: 9780201038040

Nuovi
Quantità: 1

Da

Valutazione libreria

**Descrizione libro **Condizione libro: New. Publisher/Verlag: Addison-Wesley Longman, Amsterdam | 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. | Format: Hardback | Language/Sprache: english | 1480 gr | 912 pp. Codice libro della libreria K9780201038040

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Editore:
Addison-Wesley Professional
(2011)

ISBN 10: 0201038048
ISBN 13: 9780201038040

Nuovi
Rilegato
Quantità: 1

Da

Valutazione libreria

**Descrizione libro **Addison-Wesley Professional, 2011. Hardcover. Condizione libro: New. 1. Codice libro della libreria DADAX0201038048

Maggiori informazioni su questa libreria | Fare una domanda alla libreria