CSE 204Computational Models and Complexity
Finite automata and regular expressions, universal models of computation, computability and unsolvability, relations between complexity classes, hierarchy theorems, reductions, complete problems for the major complexity classes (L, NL, P, NP, PSPACE). Other topics may include complexity of counting and enumeration problems, complexity of approximation, randomized complexity classes. (Formerly Computer Science 210.)
Prerequisite(s): CSE 201.
Find a section and add it to your scheduleLive seat counts, time-conflict checks and the walk from your previous class.
When it runs
Fall 2025Open Fall 2025
| Section | Type | When | Where | Instructor | Seats |
|---|---|---|---|---|---|
| 01 | Lecture | Tue Thu 1:30pm–3:05pm | Engineer 2 192 | S. Comandur | Open 28/40 |
Who teaches it
| Instructor | Rating | Difficulty | Would take again | Reviews |
|---|---|---|---|---|
| Seshadhri Comandur | 4.6 / 5 | 4.2 / 5 | 85% | 59 |
From RateMyProfessors, which is student-submitted and not a survey. Small review counts move a long way on one bad quarter.
SlugAtlas is a student project and is not affiliated with, endorsed by, or operated by UC Santa Cruz. Course data is a snapshot of the public class search; myUCSC is authoritative for enrolment.