Csus/resource/course/cpsc 511

From wiki.ucalgary.ca
< Csus‎ | resource
Revision as of 17:35, 21 August 2013 by Lrmactav (talk | contribs) (Created page with "<div style="text-align:center;font:32pt bolder;margin-bottom:10px"> CPSC 511 <br /> Introduction to Complexity Theory </div> <h1>Description</h1> Time and space complexity; th...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

CPSC 511
Introduction to Complexity Theory

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.

Course Notes

Previous Course Materials

Previous Tutorial Materials

Programming Languages

External Links

Retrieved from "http://wiki.ucalgary.ca/index.php?title=Csus/resource/course/cpsc_511&oldid=66526"