Algorithm and Design Complexity
暫譯: 演算法與設計複雜度

Sherine, Anli, Jasmine, Mary, Peter, Geno

Algorithm and Design Complexity
  • 出版商: CRC
  • 出版日期: 2024-12-19
  • 售價: $2,420
  • 貴賓價: 9.5 折 $2,299
  • 語言: 英文
  • 頁數: 182
  • 裝訂: Quality Paper - also called trade paper
  • ISBN: 1032409355
  • ISBN-13: 9781032409351
  • 相關分類: Algorithms-data-structures

    • 海外代購書籍(需單獨結帳)

相關主題

商品描述

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.

商品描述(中文翻譯)

計算複雜度在算法分析中至關重要，能夠選擇高效且可解的算法也非常重要。《算法與設計複雜度》一書首先討論算法分析、時間與空間的權衡、漸進符號等主題。接著，書中還包括了明確且有效的算法，稱為計算程序。進一步探討的主題包括分治法、動態規劃和回溯法。

特色：
- 包含算法基礎和設計的完整覆蓋
- 討論算法分析技術，如分治法、動態規劃和貪婪啟發式
- 提供時間和空間複雜度的教學
- 回顧背包問題的組合優化
- 簡化時間複雜度的遞迴關係

本書針對計算機科學、資訊技術和電機工程的研究生和研究人員。

類似商品