CMSC652

Complexity Theory

Reviews for this courseTestudo

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

0 reviews
Average rating: N/A

Xiaodi Wu

0 reviews
Average rating: N/A

During the Spring 2020 and Spring 2021 semesters, students could choose to take some of their courses pass-fail mid-semester which skews grade data aggregated across multiple semesters.

Average GPA of 3.46 between 30 students*

CMSC652 Grade Distribution+-0510152025303540455055606570% of studentsABCDFWother
A-: 26.67%
A: 26.67%
A+: 13.33%
B-: 13.33%
B: 13.33%
W: 3.33%
other: 3.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.