Reducibility and decidability, recursion theory, time and space complexity, P, NP, NP-completeness, PSPACE, PSPACE-completeness, L and NL, advanced topics in computability and complexity. Prerequisites: CS 124 and CS 125.
Prereqs enforced by the system: CS 124 and CS 125; Open to degree and CDE students
Votey Bldg 209 (View Campus Map)
to on Monday and Wednesday