Select the desired Level or Schedule Type to find available classes for the course. |
CSCI 1590 - Introduction to Computational Complexity |
Introduction to serial and parallel models of computation; time and space complexity classes on these models; the circuit model of computation and its relation to serial and parallel time complexity; space-time tradeoffs on serial computers; area-time tradeoffs on the VLSI computational model; interactive and probabilistically checkable proofs; the definition of NP in terms of probabilistically checkable proofs; hardness of approximations to solutions to NP-hard problems. Prerequisite: CSCI 0510.
1.000 Credit hours 1.000 Lecture hours Levels: Graduate, Undergraduate Schedule Types: Primary Meeting Computer Science Department Prerequisites: Undergraduate level CSCI 0510 Minimum Grade of S |
Return to Previous | New Search |