|
Apr 17, 2024
|
|
|
|
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: CS 4170 or CS 6170 and CS 4245 ; or permission of instructor. Cross-listed: MATH 6260 .
Add to Folder (opens a new window)
|
|