COMPUTATIONAL COMPLEXITY
In Computational Complexity we study the computational resources (time, space, communication, etc.) that are required to solve computational problems via various computational needs. Specifically, we are interested in classifying computational problems with classes of other problems that require similar amount of resources to solve. Graduate/Undergraduate Equivalency: COMP 587 . Mutually Exclusive: Cannot register for COMP 487 if student has credit for COMP 587 .
Prerequisites & course information
Short Title: COMPUTATIONAL COMPLEXITY Department: Computer Science Grade Mode: Standard Letter Course Type: Lecture Credit Hours: 3 Restrictions: Enrollment is limited to Undergraduate, Undergraduate Professional or Visiting Undergraduate level students. Course Level: Undergraduate Upper-Level Prerequisite(s): COMP 382 or COMP 409 or COMP 509 or COMP 481 or COMP 581
Sources
- Course catalogue ↗2026–2027