Computational Complexity --- Fundamentals of the theory of computation and complexity theory. Computability, undecidability, and logic. Relations between complexity classes, NP- completeness, P-completeness, and randomized computation. Applications in selected areas such as cryptography, logic programming, theorem proving, approximation of optimization problems, or parallel computing.
1 term
University of Michigan, Ann Arbor
CSE 574 at UMich: average GPA 3.65 across 48 students. Grade distribution by term. Computational Complexity --- Fundamentals of the theory of computation and…
Average GPA: 3.65
Grade distribution records: 48 students across 1 terms.
| Grade | Students | Percent |
|---|---|---|
| A+ | 6 | 12.5% |
| A | 22 | 45.8% |
| A- | 7 | 14.6% |
| B+ | 7 | 14.6% |
| B | 1 | 2.1% |
| B- | 2 | 4.2% |
| C+ | 1 | 2.1% |
| C | 1 | 2.1% |
| D+ | 1 | 2.1% |
Based on 48 student grade records across 1 term.
The course page is taking longer to load. This summary is still available.
We could not load the full course details. This summary is still available.
Still loading. This can take a moment on a slow connection.
Loading My Class Grades