| The Art of Computer Programming: Combinatorial Algorithms, Volume 4B (Addison Wesley) |
| Wednesday, 19 October 2022 | |||
This is the latest volume in Knuth's multivolume analysis of algorithms. Volume 4B, the sequel to Volume 4A, extends Knuth's exploration of combinatorial algorithms. 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. In the second half of the book, Knuth addresses Satisfiability, one of the most fundamental problems in all of computer science. The Mathematical Preliminaries Redux section of the book 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. Author: Donald E. Knuth Related ReviewsThe Art of Computer Programming, Volume 4, Fascicle 5 The Art of Computer Programming, Volume 4, Fascicle 1
For more see:
Welcome To A New Part of Donald Knuth's Magnum Opus
Donald Knuth & The Art of Computer Programming For more Book Watch just click. Book Watch is I Programmer's listing of new books and is compiled using publishers' publicity material. It is not to be read as a review where we provide an independent assessment. Some, but by no means all, of the books in Book Watch are eventually reviewed. To have new titles included in Book Watch contact BookWatch@i-programmer.info Follow @bookwatchiprog on Twitter or subscribe to I Programmer's Books RSS feed for each day's new addition to Book Watch and for new reviews.
|