|
|
Nov 24, 2024
|
|
2016-2017 Academic Catalog [ARCHIVED CATALOG]
|
CS 7220 - Computability and Complexity Credit Hour(s): 3 Fundamentals of computability theory. Undecidability. Time and space complexity. Cook’s Theorem and NP completeness. Approximation strategies for intractable problems. 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.
Level: Graduate Schedule Type(s): Lecture
|
|
|