Algorithms Illuminated -- Part 4 : Algorithms for NP-Hard Problems (Paperback)
Roughgarden, Tim
- 出版商: Soundlikeyourself Publishing, LLC
- 出版日期: 2020-07-20
- 售價: $900
- 貴賓價: 9.5 折 $855
- 語言: 英文
- 頁數: 272
- 裝訂: Quality Paper - also called trade paper
- ISBN: 0999282964
- ISBN-13: 9780999282960
-
相關分類:
Algorithms-data-structures
-
相關翻譯:
算法詳解(捲4)——NP-Hard問題算法 (簡中版)
-
Part 1 : The Basics Part 2 : Graph Algorithms and Data Structures Part 3 : Greedy Algorithms and Dynamic Programming Part 4 : Algorithms for NP-Hard Problems
立即出貨 (庫存=1)
買這商品的人也買了...
-
$810$770 -
$360$281 -
$1,900$1,805 -
$380$342 -
$690$621 -
$950$903 -
$1,350$1,283 -
$900$855 -
$2,660$2,520 -
$900$855 -
$2,185$2,070 -
$2,565$2,430 -
$2,204$2,088 -
$1,990$1,891 -
$250算法詳解 捲2 圖算法和數據結構
-
$1,853$1,755 -
$990Algorithmic Thinking: A Problem-Based Introduction
-
$680$537 -
$1,350$1,323 -
$480$379 -
$980$774 -
$1,710System Design Interview – An Insider's Guide: Volume 2 (Paperback)
-
$356算法詳解 捲3 貪心算法和動態規劃
-
$407算法詳解(捲4)——NP-Hard問題算法
-
$1,900$1,805
相關主題
商品描述
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.
商品描述(中文翻譯)
這是一系列書籍中的第四本,提供了一個易於理解、直接了當且與程式語言無關的算法入門。書中包含了所有測驗和問題的解答提示,並且作者還製作了一系列的YouTube視頻來輔助這本書。第四部分介紹了處理NP-hard問題的算法工具(啟發式算法、局部搜索、動態規劃、MIP和SAT求解器),以及快速識別野外NP-hard問題的技巧。