University of Calgary

CPSC 611 - Complexity Theory - Winter 2020

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.

Hours

  • H(3-0)

Notes

  • Computer Science 413 or equivalent is recommended as preparation for this course.

Antirequisite(s)

  • Credit for Computer Science 611 and Computer Science 511 will not be allowed.
Syllabus

Sections

This course will be offered next in Winter 2022.
Powered by UNITIS. More features.