2012-2015 Academic Catalog 
    
    Feb 01, 2025  
HELP
2012-2015 Academic Catalog [ARCHIVED CATALOG]

CS 7220 - Computability and Complexity

Course Type: Computer Science
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
DOC 2
Level: Graduate
Schedule Type(s): Lecture
Catalog Navigation
  Catalog Home
  Programs of Study
  Other Programs
  Course Descriptions
  About the University
  Academic Calendar
  Admission
  Faculty
  Policies and Resources
  Business, Raj Soin College of
  Education and Human Services, College of
  Engineering and Computer Science, College of
  Graduate School
  Lake Campus
  Liberal Arts, College of
  Medicine, Boonshoft School of
  Nursing and Health, College of
  Professional Psychology, School of
  Science and Mathematics, College of
  University College