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. General Education Requirement: Quantitative and Deductive Reasoning (QUA).
3 points Lect: 3.

Course
Number
Call Number/
Section
Days & Times/
Location
Instructor Enrollment
Spring 2014 :: COMS W4236
COMS
4236
63867
001
MW 2:40p - 3:55p
535 SEELEY W. MUDD BUILDING
M. Yannakakis 31 / 40 [ More Info ]
Autumn 2014 :: COMS W4236
COMS
4236
20600
001
TuTh 7:10p - 8:25p
233 SEELEY W. MUDD BUILDING
X. Chen 40 / 40 [ More Info ]