WCOMS4236-1: Introduction To Computational Complexity for Spring 2014

Days and Time

Mondays and Wednesdays 2:40 PM-3:55 PM

Location

535 MUDD

Allowed For:

  • Undergraduate
  • Masters
  • Professional
  • PhD
  • Undergraduate
  • Masters
  • Professional
  • 1

Prerequisites:

COMS W3261.

Notes:

None

Instructor:

Yannakakis, Mihalis

Description

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.