Aug 17, 2019  
2018-19 CATALOG 
    
  Catalog Home
  Message from the President
  Distinguished Faculty
  About the University
  Academic Calendar
  Admission and Application
  Fees and Financial Aid
  Services and Resources
  Special Academic Opportunities
  Centers and Institutes
  Academic Regulations and Catalog Rights
  Graduation Requirements
  Graduate Studies

  Colleges and Program Requirements
  Degree and Program Offerings
  Course Descriptions
  Extended Learning Programs

  Academic and Administrative Listings
  Official Notices and Policies
  Accreditation
  CSU Campus Maps and Information
  Archived Catalogs
  My Favorites
HELP
2018-19 CATALOG [ARCHIVED CATALOG]

Facebook this Course  Tweet this Course 
[Add to My Favorites]

CS 613 - Advanced Computational Complexity

Units: 3
In-depth discussion of computational complexity theory including models of computation, polynomially bounded, NP-completeness, reducibility, and beyond NP-completeness, and intractable problems. NP-complete problems in various areas will be discussed.

Prerequisite(s): CS 513 .


Facebook this Course  Tweet this Course 
[Add to My Favorites]