CMSC452
Elementary Theory of Computation
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
23 reviews
Average rating:
4.39
Spring 2023
86 reviews
Average rating:
2.84
Past Semesters
23 reviews
Average rating:
4.39
86 reviews
Average rating:
2.84
86 reviews
Average rating:
2.84