A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis (Hardcover)
Anne Benoit, Yves Robert, Frédéric Vivien
- 出版商: CRC
- 出版日期: 2013-08-27
- 售價: $2,980
- 貴賓價: 9.5 折 $2,831
- 語言: 英文
- 頁數: 380
- 裝訂: Hardcover
- ISBN: 1439825645
- ISBN-13: 9781439825648
-
相關分類:
Algorithms-data-structures
立即出貨 (庫存=1)
買這商品的人也買了...
-
$450$356 -
$520$468 -
$450$405 -
$580$458 -
$940$700 -
$650$585 -
$490$417 -
$480$408 -
$560$476 -
$360$306 -
$480$374 -
$480$408 -
$450$356 -
$550$468 -
$380$300 -
$320$288 -
$580$493 -
$550$435 -
$680$537 -
$380$300 -
$390$332 -
$460$359 -
$580$493 -
$360$284 -
$390$308
相關主題
商品描述
Presenting a complementary perspective to standard books on algorithms, A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis provides a roadmap for readers to determine the difficulty of an algorithmic problem by finding an optimal solution or proving complexity results. It gives a practical treatment of algorithmic complexity and guides readers in solving algorithmic problems.
Divided into three parts, the book offers a comprehensive set of problems with solutions as well as in-depth case studies that demonstrate how to assess the complexity of a new problem.
- Part I helps readers understand the main design principles and design efficient algorithms.
- Part II covers polynomial reductions from NP-complete problems and approaches that go beyond NP-completeness.
- Part III supplies readers with tools and techniques to evaluate problem complexity, including how to determine which instances are polynomial and which are NP-hard.
Drawing on the authors’ classroom-tested material, this text takes readers step by step through the concepts and methods for analyzing algorithmic complexity. Through many problems and detailed examples, readers can investigate polynomial-time algorithms and NP-completeness and beyond.
商品描述(中文翻譯)
《算法設計指南:範式、方法和複雜度分析》提供了一個與標準算法書籍相補的觀點,為讀者提供了一個確定算法問題難度的路線圖,通過找到最優解或證明複雜度結果來解決問題。它實用地處理了算法複雜度並指導讀者解決算法問題。
該書分為三個部分,提供了一套包含解決方案的全面問題集,以及深入的案例研究,展示如何評估新問題的複雜度。
第一部分幫助讀者理解主要的設計原則並設計高效的算法。
第二部分涵蓋了從NP完全問題到超越NP完全性的多項式歸約方法。
第三部分為讀者提供了評估問題複雜度的工具和技巧,包括如何確定哪些實例是多項式的,哪些是NP困難的。
本書借鑒了作者在課堂上經過驗證的材料,逐步引導讀者理解分析算法複雜度的概念和方法。通過許多問題和詳細的例子,讀者可以研究多項式時間算法、NP完全性以及更高級的問題。