Barnard College

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)..
3 points

Course
Number
Call Number/
Section
Days & Times/
Location
Instructor Enrollment
Autumn 2014 :: COMS W4236
COMS
4236
20600
001
TuTh 7:10p - 8:25p
233 SEELEY W. MUDD BUILDING
X. Chen 20 / 40 [ More Info ]