Apr 30, 2024  
2012-2013 University Catalog (Revised 2012-10-02) 
    
  Catalog Home
  Archived PDF Catalogs
  President’s Message
  Academic Calendar
  The California State University
  University Administration
  Admissions
  Registration
  Fees and Expenses
  Financial Aid
  Student Services
  Student Conduct and Discipline
  Educational Enhancement Programs
  Access and Equity Programs
  Support Programs
  Centers and Institutes
  Academic Policies
  Graduate Studies
  General Education
  University Programs
  All Programs
  University Interdisciplinary Programs
  College of Agriculture
  College of Business Administration
  College of Education and Integrative Services
  College of Engineering
  College of Environmental Design
  College of Letters, Arts, and Social Sciences
  College of Science
  Collins College of Hospitality Management
  Courses
  Directory
  My Portfolio
HELP
2012-2013 University Catalog (Revised 2012-10-02) [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)