Jul 20, 2025  
2025-2026 Undergraduate Bulletin 
    
2025-2026 Undergraduate Bulletin
Add to Favorites (opens a new window)

MATH 303 - Theory of Computational Complexity


Credit(s): 3
Lecture: 3
Non-Lecture: 0


A survey of the mathematical analysis of the time and space resources required to execute algorithms. Starting with the asymptotic analysis of resource needs of specific algorithms, the course builds to a study of lower bounds associated with problems, and culminates in an in-depth study of abstract resource-complexity classes such as P, NP, and PSPACE.

Prerequisite(s): MATH 239  
Offered: Spring Semester - Even Years




Add to Favorites (opens a new window)