UML Catalog : Course : Computational Complexity Theory
Graduate Online Academic Catalog

Computational Complexity Theory

Catalog Home > Computer Science > Course Listings > Computational Complexity Theory

Quick Links

Master's Program
Doctoral Program
Graduate Certificate
Back To All Courses
Printer-Friendly Version
Back to Department
How to Apply


91.510
Course ID: 008139

This course covers polynomial-time hierarchy and polynomial space, circuit complexity, structure of NP, probabilistic machines and complexity classes, complexity of counting, interactive proof systems, probabilistically checkable proofs, complexity of approximation problems, and average-case NP-completeness.

Credits: 3
Pre-Reqs. 91.502 Foundations of CS, and 91.503 Algorithms.

Disclaimer
One University Avenue . Lowell, MA 01854 . 978-934-4000 - Contact Us
This is an OfficialPage/Publication of the University of Massachusetts Lowell