CPSC511
Download as PDF
Introduction To Complexity Theory
Computer ScienceSC - Faculty of Science
Subject
CPSC - Computer Science
Description
Time and space complexity; the classes P, LOGSPACE, PSPACE and their nondeterministic counterparts; containments and separations between complexity classes; intractability and the theory of NP-completeness; complexity theories for probabilistic algorithms and for parallel algorithms.
Prerequisite(s): Computer Science 413.
Antirequisite(s): Credit for Computer Science 511 and 611 will not be allowed.
Prerequisite(s): Computer Science 413.
Antirequisite(s): Credit for Computer Science 511 and 611 will not be allowed.
Course Attributes
Fee Rate Group(Domestic) - A, Fee Rate Group(International) -A, GFC Hours (3-0)
Courses may consist of a Lecture, Lab, Tutorial, and/or Seminar. Students will be required to register in each component that is required for the course as indicated in the schedule of classes. Practicums, internships or other experiential learning modalities are typically indicated as a Lab component.
Component
LEC
Units
3
Repeat for Credit
No
Subject code
CPSC