Art of Computer Programming: Combinatorial Algorithms: 4

Valutazione media 4,53
( su 49 valutazioni fornite da GoodReads )
 
9780201038040: Art of Computer Programming: Combinatorial Algorithms: 4

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.

I migliori risultati di ricerca su AbeBooks

Edizione Internazionale
Edizione Internazionale

1.

Knuth
ISBN 10: 0201038048 ISBN 13: 9780201038040
Nuovi Soft cover Quantità: > 20
Edizione Internazionale
Da
University Bookstore
(DELHI, DELHI, India)
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

Compra nuovo
EUR 20,31
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 10,00
Da: India a: U.S.A.
Destinazione, tempi e costi
Edizione Internazionale
Edizione Internazionale

2.

Knuth
ISBN 10: 0201038048 ISBN 13: 9780201038040
Nuovi Paperback Quantità: 5
Edizione Internazionale
Da
PRIORITY BOOKS
(springfield, VA, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Paperback. Condizione libro: New. Softcover Book, Condition: New. 1st Edition. [Please Read Carefully Before Buying], This Is An International Edition. Printed In Black and White. 912 pages, Book Cover And ISBN No May Be Different From US Edition. Restricted Sales Disclaimer Wordings Not For Sales In USA And Canada May Be Printed On The Cover Of The Book. Standard Shipping 7-14 Business Days. Expedited Shiping 4-8 Business Days. ***WE DO NOT ENTERTAIN BULK ORDERS.*** The Books May Be Ship From Overseas For Inventory Purpose. Codice libro della libreria 384918

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 31,33
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,69
In U.S.A.
Destinazione, tempi e costi
Edizione Internazionale
Edizione Internazionale

3.

Knuth
ISBN 10: 0201038048 ISBN 13: 9780201038040
Nuovi Paperback Quantità: 1
Edizione Internazionale
Da
Nick Book House
(fresno, CA, U.S.A.)
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

Compra nuovo
EUR 31,42
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,69
In U.S.A.
Destinazione, tempi e costi

4.

Donald E. Knuth
Editore: Pearson Education (US), United States (2011)
ISBN 10: 0201038048 ISBN 13: 9780201038040
Nuovi Rilegato Quantità: 1
Da
The Book Depository
(London, Regno Unito)
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 AAB9780201038040

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 56,71
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

5.

Donald E. Knuth
Editore: Pearson Education (US), United States (2011)
ISBN 10: 0201038048 ISBN 13: 9780201038040
Nuovi Rilegato Quantità: 1
Da
The Book Depository US
(London, Regno Unito)
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 AAB9780201038040

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 56,88
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

6.

Donald E. Knuth
Editore: Addison-Wesley Professional (2011)
ISBN 10: 0201038048 ISBN 13: 9780201038040
Nuovi Rilegato Quantità: 1
Da
Ergodebooks
(RICHMOND, TX, U.S.A.)
Valutazione libreria
[?]

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

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 57,43
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,69
In U.S.A.
Destinazione, tempi e costi

7.

Knuth, Donald E.
Editore: Prentice Hall
ISBN 10: 0201038048 ISBN 13: 9780201038040
Nuovi Quantità: > 20
Da
INDOO
(Avenel, NJ, U.S.A.)
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

Compra nuovo
EUR 58,40
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,24
In U.S.A.
Destinazione, tempi e costi

8.

Donald E. Knuth
Editore: Pearson Education (US), New Jersey
ISBN 10: 0201038048 ISBN 13: 9780201038040
Nuovi paperback Quantità: 1
Da
Blackwell's
(Oxford, OX, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Pearson Education (US), New Jersey. paperback. Condizione libro: New. Codice libro della libreria 9780201038040

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 61,02
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 5,19
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

9.

Knuth, Donald E.
ISBN 10: 0201038048 ISBN 13: 9780201038040
Nuovi Quantità: 1
Da
English-Book-Service Mannheim
(Mannheim, Germania)
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

Compra nuovo
EUR 73,80
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 5,00
Da: Germania a: U.S.A.
Destinazione, tempi e costi

10.

Donald E. Knuth
Editore: Addison-Wesley Professional (2011)
ISBN 10: 0201038048 ISBN 13: 9780201038040
Nuovi Rilegato Quantità: 1
Da
Irish Booksellers
(Rumford, ME, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Addison-Wesley Professional, 2011. Hardcover. Condizione libro: New. book. Codice libro della libreria 0201038048

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 78,94
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
In U.S.A.
Destinazione, tempi e costi

Vedi altre copie di questo libro

Vedi tutti i risultati per questo libro