ISBN: 9780137935109 - the art of computer programming: fundamental algorithms / seminumerical algorithms / sorting and searching / combinatorial algorithms, part 1 / combinatorial algorithms, part 2 (42 risultati)

hardcover. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Hardcover. Condizione: Very Good. 1. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Hardcover. Condizione: New. 1. The item is brand new, never used or read. It's in perfect condition and may include supplements and/or access codes or come shrink-wrapped.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Condizione: As New. Unread book in perfect condition.

Condizione: NEW.

Hardcover. Condizione: New. Brand new book, sourced directly from publisher. Dispatch time is 3-4 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Condizione: New.

Condizione: New.

UNK. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Taschenbuch. Condizione: Neu. Neuware -Now Includes the Long-Anticipated Volume 4B!Countless readers have spoken about the profound personal influence of Knuth's work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his 'cookbook' solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.Primarily written as a reference, some people have nevertheless found it possible and interesting to read each volume from beginning to end. A programmer in China even compared the experience to reading a poem. Whatever your background, if you need to do any serious computer programming, you will find your own good reason to make each volume in this series a readily accessible part of your scholarly or professional library.These five books comprise what easily could be the most important set of information on any serious programmer's bookshelf.This set now includes Volume 4B, the sequel to Volume 4A, which extends Knuth's exploration of combinatorial algorithms. These algorithms are of keen interest to software designers because '. . . a single good idea can save years or even centuries of computer time.''Donald Knuth may very well be a great master of the analysis of algorithms, but more than that, he is an incredible and tireless storyteller who always strikes the perfect balance between theory, practice, and fun. [The Art of Computer Programming, Volume 4B, Combinatorial Algorithms, Part 2,] dives deep into the fascinating exploration of search spaces (which is quite like looking for a needle in a haystack or, even harder, to prove the absence of a needle in a haystack), where actions performed while moving forward must be meticulously undone when backtracking. It introduces us to the beauty of dancing links for removing and restoring the cells of a matrix in a dance which is both simple to implement and very efficient. And it studies the iconic and versatile satisfiability problem and carefully analyses various ingredients of SAT solvers.' --Christine Solnon, Department of Computer Science, INSA LyonThis box set includes the following volumes: The Art of Computer Programming: Volume 1: Fundamental Algorithms, 3rd EditionThe Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd EditionThe Art of Computer Programming: Volume 3: Sorting and Searching, 2nd EditionThe Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1The Art of Computer Programming, Volume 4B: Combinatorial Algorithms, Part 2 736 pp. Englisch.…

Taschenbuch. Condizione: Neu. Neuware -Now Includes the Long-Anticipated Volume 4B!Countless readers have spoken about the profound personal influence of Knuth's work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his 'cookbook' solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.Primarily written as a reference, some people have nevertheless found it possible and interesting to read each volume from beginning to end. A programmer in China even compared the experience to reading a poem. Whatever your background, if you need to do any serious computer programming, you will find your own good reason to make each volume in this series a readily accessible part of your scholarly or professional library.These five books comprise what easily could be the most important set of information on any serious programmer's bookshelf.This set now includes Volume 4B, the sequel to Volume 4A, which extends Knuth's exploration of combinatorial algorithms. These algorithms are of keen interest to software designers because '. . . a single good idea can save years or even centuries of computer time.''Donald Knuth may very well be a great master of the analysis of algorithms, but more than that, he is an incredible and tireless storyteller who always strikes the perfect balance between theory, practice, and fun. [The Art of Computer Programming, Volume 4B, Combinatorial Algorithms, Part 2,] dives deep into the fascinating exploration of search spaces (which is quite like looking for a needle in a haystack or, even harder, to prove the absence of a needle in a haystack), where actions performed while moving forward must be meticulously undone when backtracking. It introduces us to the beauty of dancing links for removing and restoring the cells of a matrix in a dance which is both simple to implement and very efficient. And it studies the iconic and versatile satisfiability problem and carefully analyses various ingredients of SAT solvers.' --Christine Solnon, Department of Computer Science, INSA LyonThis box set includes the following volumes: The Art of Computer Programming: Volume 1: Fundamental Algorithms, 3rd EditionThe Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd EditionThe Art of Computer Programming: Volume 3: Sorting and Searching, 2nd EditionThe Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1The Art of Computer Programming, Volume 4B: Combinatorial Algorithms, Part 2 736 pp. Englisch.…

Condizione: New. Brand new! Please provide a physical shipping address.

Taschenbuch. Condizione: Neu. Art of Computer Programming, The, Volumes 1-4B, Boxed Set | Donald Knuth (u. a.) | Taschenbuch | 736 S. | Englisch | 2022 | Pearson | EAN 9780137935109 | Verantwortliche Person für die EU: Pearson Studium im Verlag Pearson Benelux B.V. Zweigniederla, Sankt-Martin-Str. 82, 81541 München, buchhandel[at]pearson[dot]com | Anbieter: preigu. …

Hardcover. Condizione: new. Hardcover. Now Includes the Long-Anticipated Volume 4B! Countless readers have spoken about the profound personal influence of Knuth's work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books. Primarily written as a reference, some people have nevertheless found it possible and interesting to read each volume from beginning to end. A programmer in China even compared the experience to reading a poem. Whatever your background, if you need to do any serious computer programming, you will find your own good reason to make each volume in this series a readily accessible part of your scholarly or professional library. These five books comprise what easily could be the most important set of information on any serious programmer's bookshelf. This set now includes Volume 4B, the sequel to Volume 4A, which extends Knuth's exploration of combinatorial algorithms. These algorithms are of keen interest to software designers because ". . . a single good idea can save years or even centuries of computer time." "Donald Knuth may very well be a great master of the analysis of algorithms, but more than that, he is an incredible and tireless storyteller who always strikes the perfect balance between theory, practice, and fun. [The Art of Computer Programming, Volume 4B, Combinatorial Algorithms, Part 2,] dives deep into the fascinating exploration of search spaces (which is quite like looking for a needle in a haystack or, even harder, to prove the absence of a needle in a haystack), where actions performed while moving forward must be meticulously undone when backtracking. It introduces us to the beauty of dancing links for removing and restoring the cells of a matrix in a dance which is both simple to implement and very efficient. And it studies the iconic and versatile satisfiability problem and carefully analyses various ingredients of SAT solvers." --Christine Solnon, Department of Computer Science, INSA Lyon This box set includes the following volumes: The Art of Computer Programming: Volume 1: Fundamental Algorithms, 3rd EditionThe Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd EditionThe Art of Computer Programming: Volume 3: Sorting and Searching, 2nd EditionThe Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1The Art of Computer Programming, Volume 4B: Combinatorial Algorithms, Part 2 Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Taschenbuch. Condizione: Neu. Neuware -Now Includes the Long-Anticipated Volume 4B.

Condizione: New. pp. 736.

hardcover. Condizione: New. Brand new book, sourced directly from publisher. Dispatch time is 24-48 hours from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Gebunden. Condizione: New. &Uumlber den AutorDonald 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 hi.

Hardcover. Condizione: New. Brand new book, sourced directly from publisher. Dispatch time is 9-10 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

hardcover. Condizione: New. Special order direct from the distributor.

Taschenbuch. Condizione: Neu. Neuware -Now Includes the Long-Anticipated Volume 4B!Countless readers have spoken about the profound personal influence of Knuth's work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his 'cookbook' solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.Primarily written as a reference, some people have nevertheless found it possible and interesting to read each volume from beginning to end. A programmer in China even compared the experience to reading a poem. Whatever your background, if you need to do any serious computer programming, you will find your own good reason to make each volume in this series a readily accessible part of your scholarly or professional library.These five books comprise what easily could be the most important set of information on any serious programmer's bookshelf.This set now includes Volume 4B, the sequel to Volume 4A, which extends Knuth's exploration of combinatorial algorithms. These algorithms are of keen interest to software designers because '. . . a single good idea can save years or even centuries of computer time.''Donald Knuth may very well be a great master of the analysis of algorithms, but more than that, he is an incredible and tireless storyteller who always strikes the perfect balance between theory, practice, and fun. [The Art of Computer Programming, Volume 4B, Combinatorial Algorithms, Part 2,] dives deep into the fascinating exploration of search spaces (which is quite like looking for a needle in a haystack or, even harder, to prove the absence of a needle in a haystack), where actions performed while moving forward must be meticulously undone when backtracking. It introduces us to the beauty of dancing links for removing and restoring the cells of a matrix in a dance which is both simple to implement and very efficient. And it studies the iconic and versatile satisfiability problem and carefully analyses various ingredients of SAT solvers.' --Christine Solnon, Department of Computer Science, INSA LyonThis box set includes the following volumes: The Art of Computer Programming: Volume 1: Fundamental Algorithms, 3rd EditionThe Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd EditionThe Art of Computer Programming: Volume 3: Sorting and Searching, 2nd EditionThe Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1The Art of Computer Programming, Volume 4B: Combinatorial Algorithms, Part 2GPSR Kontakt, Harvestehuder Weg 42, 20149 Hamburg 736 pp. Englisch.…

Condizione: New. In English.