CS 7220 - Computability and Complexity

Credit Hour(s): 3

Course 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

Enrollment 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.

Course Level: Graduate
Schedule Type(s): Lecture

Grade Mode: Standard
An additional fee is associated with this course.