Go to Main Content

SCT WWW Information System



Detailed Course Information


Fall 2019 Semester
Aug 02, 2021
Transparent Image
Information Select the desired Level or Schedule Type to find available classes for the course.

CS 4805 - Fundamentals of Complexity Theory
Examines formal models of computation, notions of undecidability, and complexity theory. Topics include finite automata and regular languages, context-free grammars and pushdown automata, and time complexity. Advanced topics in complexity theory include probabilistic computation, polynomial hierarchy, oracle separations, circuit and space complexity, interactive proofs, and quantum computing.
4.000 Credit hours
4.000 Lecture hours

Levels: Undergraduate
Schedule Types: Lecture

Computer Science Department

Course Attributes:
Computer&Info Sci

Must be enrolled in one of the following Levels:     

Undergraduate level CS 3800 Minimum Grade of D-

Return to Previous New Search
Transparent Image
Skip to top of page