COMPSCI 750 - Computational Complexity
Faculty
Science
Department
Computer Science
Points:
15
Available Semesters:
{}
Course Components
Labs
Tutorials
Lectures
Exam
TBLs
Workshops
Description: Definitions of computational models and complexity classes: time complexity (e.g., P and NP), space complexity (e.g., L and PSPACE), circuit and parallel complexity (NC), polynomial-time hierarchy (PH), interactive complexity (IP), probabilistic complexity (BPP), and fixed-parameter complexity. Recommended preparation: COMPSCI 320 or 350
Prerequisites / Restrictions
.
Average Rating From 0 Reviews
Teaching Quality
-
Content Quality
-
Workload
-
Difficulty
-
0% - Would Recommend
0% - Would Not Recommend
Reviews