CS 6060 - Computational Complexity

Complexity of computational problems explored with respect to a variety of complexity measures. Topics iinclude deterministic time complexity, nondeterministic time complexity, the polynomial-time hierarchy, average-case time complexity, space-bounded complexity, circuit complexity, reductions, relativizations, and parallel models of computation.

Requisites
CS 5060
Credit Hours: 3.0
Repeat/Retake Information: May not be retaken.

Lecture/Lab Hours: 3.0 lecture

Eligible grades: A-F,WP,WF,FN,FS,AU,I