CSCE 52603 — Computational Complexity
Turing machines, recursion theory and computability, complexity measures, NP-completeness, analysis on NP-complete problems, pseudo-polynomial and approximation. Prerequisite: Computer Science Computer Engineering (CSCE) graduate standing. (Typically offered: Irregular)