Feb 05, 2025  
2017-2018 Undergraduate Bulletin 
    
Catalog Navigation
  Bulletin Home
  Academic Programs
  Course Descriptions
  Geneseo’s Mission
  Accreditation
  Geneseo’s Statement on Diversity and Community
  Administrative Services
  Academic Services
  Academic Organizations
  Academic Policies
  Baccalaureate Degree Programs
  Requirements for Baccalaureate Degree Programs
  Pre-Professional Advisory Programs
  Emeriti/Emeritae
  Archived Catalogs
  My Favorites
HELP
2017-2018 Undergraduate Bulletin [ARCHIVED CATALOG]

Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
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. Not offered on a regular basis.

Prerequisite(s): MATH 239 .


Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to Favorites (opens a new window)