Computability and Complexity

CSE 6321

Transcript Abbreviation:

Cmptblty & Cmplxty

Course Description:

Turing machines, decidability, recursive enumerability; many-to-one and polynomial-time reductions; NP-completeness, Cook-Levin Theorem; Recursion Theorem.

Course Levels:

Graduate

Designation:

Elective

General Education Course

(N/A)

Cross-Listings

(N/A)