CMSC652

Complexity Theory

Reviews for this course Testudo

Prerequisite: CMSC451 or CMSC452; or permission of instructor. Credit only granted for: CMSC652 or CMSC858G. Formerly: CMSC858G.This course will define what it means for a problem to be hard (or easy in a variety of ways. The emphasis will be on natural problems. Topics may include NP-completeness, Sparse Sets, Graph Isomoprhism (why it is thought to not be NP-complete), Counting problems, and approximation problems.

Past Semesters

William Gasarch

23 reviews
Average rating: 4.39

Xiaodi Wu

3 reviews
Average rating: 4.33

* "W"s are considered to be 0.0 quality points. "Other" grades are not factored into GPA calculation. Grade data not guaranteed to be correct.