Algorithms
Material type:
Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
![]() |
Main Library Reference | Reference | 005.1 DAS (Browse shelf(Opens below)) | Available | 013162 |
Included Index.
Prologue --
Algorithms with numbers --
Divide-and conquer algorithms --
Decompositions of graphs --
Paths in graphs --
Greedy algorithms --
Dynamic programming --
Linear programming and reductions --
NP-complete problems --
Coping with NP-completeness --
Quantum algorithms.
Explaining the fundamentals of algorithms, this text emphasizes on understanding the mathematical idea behind each algorithm. It includes features such as: the use of boxes to strengthen the narrative: pieces that give historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated.
There are no comments on this title.