**COMS W 4236y Introduction to Computational Complexity**

Develops a quantitative theory of the computational difficulty of problems in
terms of the resources (eg. 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. - M. Yannakakis, R.
Servedio

*Prerequisites: COMS W3261. BC: Fulfillment of General Education
Requirement: Quantitative and Deductive Reasoning (QUA)..*