| Algorithms Illuminated - Part 4 (Soundlikeyourself Publishing) |
| Friday, 07 August 2020 |
|
Algorithms for NP-Hard Problems is the fourth book in a series that provides an accessible, no-nonsense, and programming language-agnostic introduction to algorithms. The book includes hints or solutions to all quizzes and problems, and is accompanied by a series of YouTube videos by the author Tim Roughgarden, a Professor of Computer Science at Columbia University and well known to us for the Coursera Algorithms Specialization from when he was at Stanford University. Part 4, both of the Coursera series of courses and the set of books, covers algorithmic tools for tackling NP-hard problems (heuristic algorithms, local search, dynamic programming, MIP and SAT solvers) and techniques for quickly recognizing NP-hard problems in the wild. <ASIN:0999282964>
Author: Tim Roughgarden
See also the Book Watch for Algorithms Illuminated, Part 3 Coursera Algorithms Specialization 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.
|
