May 04, 2024  
2015-2016 University Catalog 
    
  Catalog Home
  Archived PDF Catalogs
  University Administration, Regulations, and History
  Enrollment Services
  Academic Policies
  Graduate Studies - General Information
  Student Programs for Support and Enrichment
  General Education Program
  College of Agriculture
  College of Business Administration
  College of Education and Integrative Studies
  College of Engineering
  College of Environmental Design
  College of Letters, Arts, and Social Sciences
  College of Science
  The Collins College of Hospitality Management
  College of the Extended University
  University Interdisciplinary Programs
  Index of Courses
  Index of Academic Programs
  Centers and Institutes
  Academic Calendar
  Directory
  My Portfolio
HELP
2015-2016 University Catalog [ARCHIVED CATALOG]

Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to Portfolio (opens a new window)

CS 531 - Computability and Complexity Theory (4)

Formalizing problems and algorithms. Characterizations and properties of computability classes, undecidability. Complexity classes. NP-complete problems, proof of NP-completeness.

Prerequisite(s): CS 311  and CS 331 , or consent of instructor.
Component(s): 4 lectures/problem-solving.


Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to Portfolio (opens a new window)