WCOMS4236-1: Introduction To Computational Complexity for Spring 2018

Days and Time

Tuesdays and Thursdays 1:10 PM-2:25 PM

Location

RTBA BTBA

Allowed For:

  • Undergraduate
  • Masters
  • Professional
  • PhD

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.