株式会社極東書店トップ ＞ 商品一覧 ＞ Algorithm and Design Complexity.
商品詳細
Algorithm and Design Complexity.
・ISBN 978-1-032-40935-1 paper GB£ 50.99
￥16,153.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
| 著者・編者 | Sherine, Anli / Jasmine, Mary / Peter, Geno / Alexander, S. Albert, |
|---|---|
| 出版社 | (CRC Press, UK) |
| 出版年月 | 2024 |
| ページ数 | 182 pp. |
| 言語 | ENG |
| ニュース番号 | ＜A03-78594＞ |
解説
Computational complexity is critical in analysis of algorithms and is important to be able to select algorithms for efficiency and solvability. Algorithm and Design Complexity initiates with discussion of algorithm analysis, time-space trade-off, symptotic notations, and so forth. It further includes algorithms that are definite and effective, known as computational procedures. Further topics explored include divide-and-conquer, dynamic programming, and backtracking.
Features:
- Includes complete coverage of basics and design of algorithms
- Discusses algorithm analysis techniques like divide-and-conquer, dynamic programming, and greedy heuristics
- Provides time and space complexity tutorials
- Reviews combinatorial optimization of Knapsack problem
- Simplifies recurrence relation for time complexity
This book is aimed at graduate students and researchers in computers science, information technology, and electrical engineering.