CMSC452

Elementary Theory of Computation

Reviews for this course Testudo

Prerequisite: Minimum grade of C- in CMSC351; and permission of CMNS-Computer Science department. Or must be in the (Computer Science (Doctoral), Computer Science (Master's)) program. Techniques are developed to determine the difficulty of a problem relative to a model of computation. Topics include Finite Automata, P, NP, decidability, undecidability, and communication complexity.

Spring 2024

William Gasarch

24 reviews
Average rating: 4.38

Past Semesters

William Gasarch

24 reviews
Average rating: 4.38

Clyde Kruskal

94 reviews
Average rating: 2.83

Clyde Kruskal

94 reviews
Average rating: 2.83

Clyde Kruskal

94 reviews
Average rating: 2.83

* "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.