Computability and Complexity

Course Type: 
CS
Code: 
7220
Level: 
Graduate
Credit Hours: 
3
Schedule Type: 
Lecture
Description: 

Fundamentals of computability theory. Undecidability. Time and space complexity. Cook's Theorem and NP completeness. Approximation strategies for intractable problems. Department Managed Prerequisite(s): Undergraduate level CS 3200 Minimum Grade of D or Graduate level CS 5200 Minimum Grade of D

Restrictions: 
Must be enrolled in one of the following Levels: Graduate, Medical, Professional. Must be enrolled in one of the following Colleges: College of Egr & Computer Sci.