CS 6260 - Computation and Complexity

Units: 4
Languages and algorithms; decision problems; Turing machines and Turing-Completeness; decidability; measures and classes of time and space complexity (e.g., P, NP, PSPACE); NP-Completeness. Prerequisites: MATH/ CS 4170 (or CS 6170 ) and MATH/CS 4245 . Cross-listed MATH 6260.