Deterministic and non-deterministic time and space complexity; complexity classes and hierarchies; NP-complete problems and intractable problems; axiomatic complexity theory.
This course may not be repeated for credit.
Notes
- Computer Science 413 is recommended as preparation for this course.
Prerequisite(s)
- Consent of the Department.
Sections
This course will be offered next in
Winter 2014.