|
May 09, 2025
|
|
|
|
COSC 5200 - Computational Complexity Credits: 3 Study of efficient computation and computational intracability. Time and space complexity; P, NP, and the polynomial-time hierarchy; reductions and completeness; randomized complexity; non-uniform complexity; approximation algorithms and inapproximability.
Prerequisite: COSC 4100 or COSC 4200 .
Add to Portfolio (opens a new window)
|
|