Algorithms Illuminated (Part 4): Algorithms for NP-Hard Problems

书名：Algorithms Illuminated (Part 4): Algorithms for NP-Hard Problems
作者：TimRoughgarden
译者：
ISBN：9780999282960
出版社：SoundlikeyourselfPublishing,LLC
出版时间：2020-7-16
格式：epub/mobi/azw3/pdf
页数：271
豆瓣评分：

书籍简介：

Fourth book in a series that provides an accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Includes hints or 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.

作者简介：

Tim Roughgarden is a Professor of Computer Science at Columbia University. Prior to joining Columbia, he spent 15 years on the computer science faculty at Stanford, following a PhD at Cornell and a postdoc at UC Berkeley. His research interests include the many connections between computer science and economics, as well as the design, analysis, applications, and limitations of algorithms. For his research, he has been awarded the ACM Grace Murray Hopper Award, the Presidential Early Career Award for Scientists and Engineers (PECASE), the Kalai Prize in Computer Science and Game Theory, the Social Choice and Welfare Prize, the Mathematical Programming Society's Tucker Prize, and the EATCS-SIGACT Gödel Prize. He was an invited speaker at the 2006 International Congress of Mathematicians, the Shapley Lecturer at the 2008 World Congress of the Game Theory Society, and a Guggenheim Fellow in 2017. His books include Twenty Lectures on Algorithmic Game Theory (2016) and the Algorithms Illuminated book series (2017-2019).

书友短评：

　　Algorithms Illuminated(共4册)，这套丛书还有《Algorithms Illuminated》《Algorithms Illuminated (Part 2)》《Algorithms Illuminated (Part 3)》。

添加微信公众号:好书天下获取