WCOMS4236-1: Introduction To Computational Complexity for Fall 2019

Days and Time

(no day) -

Allowed For:

  • Undergraduate
  • Masters
  • Professional
  • PhD

Prerequisites:

COMS W3261.

Notes:

None

Instructor:

Chen, Xi

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.