The art of computer programming : Volume 4B Combinatorial algorithms Part 2

The Art of Computer Programming is Knuth's multivolume analysis of algorithms. With the addition of this new volume, it continues to be the definitive description of classical computer science. Volume 4B, the sequel to Volume 4A, extends Knuth's exploration of combinatorial algorithms. The...

Description complète

Enregistré dans:
Détails bibliographiques
Auteur principal : Knuth Donald Ervin (Auteur)
Format : Livre
Langue : anglais
Titre complet : The art of computer programming. Volume 4B, Combinatorial algorithms. Part 2 / Donald E. Knuth,...
Publié : Boston, Paris [etc.] : Addison-Wesley , C 2023
Description matérielle : 1 vol. (xvii-714 p.)
Contenu : Contient des exercices
Sujets :
LEADER 03462cam a2200457 4500
001 PPN269837167
003 http://www.sudoc.fr/269837167
005 20240531110600.0
010 |a 978-0-201-03806-4  |b rel. 
010 |a 0-201-03806-4  |b rel. 
035 |a (OCoLC)1389428711 
100 |a 20230511h20232023k y0frey0103 ba 
101 0 |a eng  |2 639-2 
102 |a US  |a FR  |a ZZ 
105 |a a ||||001yy 
106 |a r 
181 |6 z01  |c txt  |2 rdacontent 
181 1 |6 z01  |a i#  |b xxxe## 
182 |6 z01  |c n  |2 rdamedia 
182 1 |6 z01  |a n 
183 |6 z01  |a nga  |2 RDAfrCarrier 
200 1 |a The art of computer programming  |h Volume 4B  |i Combinatorial algorithms  |h Part 2  |f Donald E. Knuth,... 
214 0 |a Boston  |a Paris [etc.]  |c Addison-Wesley 
214 4 |d C 2023 
215 |a 1 vol. (xvii-714 p.)  |c ill., fig., tabl.  |d 25 cm 
312 |a La jaquette porte en plus : "The classic work extended and refined" 
320 |a Index. Glossaire 
327 2 |a Contient des exercices 
330 |a The Art of Computer Programming is Knuth's multivolume analysis of algorithms. With the addition of this new volume, it continues to be the definitive description of classical computer science. Volume 4B, the sequel to Volume 4A, 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." The book begins with coverage of Backtrack Programming, together with a set of data structures whose links perform "delightful dances" and are ideally suited to this domain. New techniques for important applications such as optimum partitioning and layout are thereby developed. Knuth's writing is playful, and he includes dozens of puzzles to illustrate the algorithms and techniques, ranging from popular classics like edge-matching to more recent crazes like sudoku. Recreational mathematicians and computer scientists will not be disappointed! In the second half of the book, Knuth addresses Satisfiability, one of the most fundamental problems in all of computer science. Innovative techniques developed at the beginning of the twenty-first century have led to game-changing applications, for such things as optimum scheduling, circuit design, and hardware verification. Thanks to these tools, computers are able to solve practical problems involving millions of variables that only a few years ago were regarded as hopeless. The Mathematical Preliminaries Redux section of the book is a special treat, which presents basic techniques of probability theory that have become prominent since the original "preliminaries" were discussed in Volume 1. As in every volume of this remarkable series, the book includes hundreds of exercises that employ Knuth's ingenious rating system, making it easy for readers of varying degrees of mathematical training to find challenges suitable to them. Detailed answers are provided to facilitate self-study.  |2 4e de jaquette 
517 | |a Combinatorial algorithms 
606 |3 PPN027241378  |a Microordinateurs  |x Programmation  |2 rameau 
606 |3 PPN027282171  |a Algorithmes  |2 rameau 
676 |a 005.1  |v 23 
686 |a 68R05  |v 2020  |2 msc 
686 |a 05A17  |v 2020  |2 msc 
686 |a 05A18  |v 2020  |2 msc 
700 1 |3 PPN032581270  |a Knuth  |b Donald Ervin  |f 1938-....  |4 070 
801 3 |a FR  |b Abes  |c 20230512  |g AFNOR 
930 |5 441092208:822805502  |b 441092208  |j u 
979 |a CCFA 
998 |a 967843