WCOMS4236-1: Introduction To Computational Complexity for Spring 2022
Days and Time
Tuesdays and Thursdays 8:40 AM-9:55 AM
Servedio, Rocco A.
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.