Algorithms Illuminated (Part 4): Algorithms for NP-Hard Problems
- Downloads：9270
- Type：Epub+TxT+PDF+Mobi
- Create Date：2021-09-22 09:56:27
- Update Date：2025-09-07
- Status：finish
- Author：Tim Roughgarden
- ISBN：0999282964
- Environment：PC/Android/iPhone/iPad/Kindle
- Download
Summary
Fourth book in a series that provides an accessible， no-nonsense， and programming language-agnostic introduction to algorithms。 Includes hints of solutions to all quizzes and problems， and a series of YouTube videos by the author accompanies the book。 Part 4 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。
Reviews
Anthony O'Connor
，
Excellent finaleAn excellent finale to an excellent series。 A bit rushed in some places maybe but it cleared up a few major points for me。 So that was great。 The author did decide to redefine NP in terms of search problems。 He made it clear that he was doing so。 And maybe it should have been done that way originally。 But it wasn’t。 You can’t say everyone else calls it a duck but I’m going to call it a dog。 That’s just confusing。 For this faux pas he gets a four rather than a five。
Heather Fryling
，