Apr 29, 2024  
2020-2021 Undergraduate Bulletin 
    
Catalog Navigation
  Bulletin Home
  Geneseo’s Mission, Values, & Vision
  Geneseo’s Statement on Diversity and Community
  Geneseo’s Statement on Sustainability
  College Policies
  Officers of the College
  SUNY Geneseo @ A Glance
  Academic Programs
  Course Descriptions
  Requirements for Baccalaureate Degree Programs
  GLOBE: Baccalaureate Learning Outcomes
  Baccalaureate Degree Programs
  Pre-Professional Advisory Programs
  Academic Policies, Standards, and Information
  Academic Services
  Academic Organizations
  Student Accounts
  Student and Campus Life
  Campus Auxiliary Services
  Advancement
  Enrollment Management & Admissions
  Financial Aid
  Emeriti/Emeritae
  Archived Catalogs
  My Favorites
HELP
2020-2021 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

2020-2021 Catalog Year

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


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