|
||||
CS 7220 - Computability and ComplexityCredit Hour(s): 3 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. Level: Graduate Schedule Type(s): Lecture
|
||||
All catalogs © 2024 Wright State University. Powered by the Acalog™ Academic Catalog Management System™ (ACMS™).
|