Search Results

COMS W4236 Introduction to Computational Complexity. 3 points.

Lect: 3.

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.

Spring 2018: COMS W4236
Course Number Section/Call Number Times/Location Instructor Points Enrollment
COMS 4236 001/28954 T Th 1:10pm - 2:25pm
420 Pupin Laboratories
Mihalis Yannakakis 3 45/50