Catalog Search
> Computer Related
> COMP.5100
Note: This course is not available for the current semester.
Course No: COMP.5100; Last Offered: No Data;
Course Description
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.
Prerequisites & Notes
- Prerequisites:
- Special Notes:
- Credits: 3;
Questions About This Course?
Contact the Advising Center at 978-934-2474 or
Continuing_Education@uml.edu
Use the Back button in your browser to go back to search results.