Computatinal complexity: P-space and EXP classes, Reduction, NP-comlete problems, Cook’s therem, Randamized algorithms, Approximation alogorithms, Branvh and Bound, Amortized analysis; Max flow, Bipartite matching; Geometric algoriths: Convex hull, Closest pairs; Computability: Turing machines, Church-Turing thesis, Rice’s theorem, Undecidability. Prerequisite: ICS 353 or Equivale