CMPS 4710
Computational Complexity
Tulane University of Louisiana · UGRD · Fall 2026
1 section
Catalog description
This course is an advanced introduction to the area of computational complexity. Topics covered include: impossibility and separability results for classical computation, interactive theorem proving and the PCP theorem, derandomization and hardness of approximation, and the quantum model of computation.
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verifiedClass #tulane_louisiana-2109Fall 2026UGRD3 credits
- Days & times
- No scheduled meeting time
- Meeting dates
- —
- Location
- —
- Instructor
- Staff
Class numbers and section codes come from the registrar.
Spot missing or incorrect course data?