|Day & Time
524 Seeley W. Mudd Building
|Method of Instruction||In-Person|
Prerequisites: (COMS W3261) Develops a quantitative theory of the computational difficulty of problems in terms of the resources (e.g. time, space) needed to solve them. Classification of problems into complexity classes, reductions, and completeness. Power and limitations of different modes of computation such as nondeterminism, randomization, interaction, and parallelism.
|Enrollment||24 students (55 max) as of 9:06PM Wednesday, November 29, 2023|