COMP 5502 Algorithm Analysis and Complexity Theory – 8 ECTS
Asymptotic Notations and Properties, Worst-case Analysis, Best-case Analysis, Average-case Analysis, Analysis of Iterative Algorithms, Analysis of Recursive Algorithms, Dynamic Programming, State-space Search, Decrease and Conquer, Divide and Conquer, Randomized Algorithms, Blind Search, Heuristic Algorithms, Branch and Bound, Problem Types, Complexity Classes, Decidability.
- 2020 Fall, Dr. Mutlu Beyazıt
- Bologna Link(link)
- 2019 Fall, Dr. Mutlu Beyazıt