株式会社極東書店トップ ＞ 商品一覧 ＞ A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis.
商品詳細
A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis.
・ISBN 978-1-4398-2564-8 hard GB£ 103.99
￥32,943.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
| 著者・編者 | Benoit, Anne / Robert, Yves / Vivien, Frederic, |
|---|---|
| シリーズ | (Chapman & Hall/CRC Applied Algorithms and Data Structures series) |
| 出版社 | (CRC Press Inc, US) |
| 出版年月 | 2013 |
| ページ数 | 380 pp. |
| 言語 | ENG |
| ニュース番号 | ＜A00-26630＞ |
解説
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.