May 01, 2024  
2018-2019 Graduate Catalog 
    
Catalog Navigation
  Catalog Home
  University Calendar
  The Graduate School
  About the University
  Admission to Graduate Programs
  Colleges
  Academic Departments
  Degrees Offered
  Programs of Study
  Course Descriptions
  Outreach & Engagement
  Tuition, Fees and Expenses
  Financial Assistance
  General Regulations
  Student Services
  Graduate Faculty
  Publishing Statement
  Your Right To Know
  Discrimination and Harassment
HELP
2018-2019 Graduate Catalog [ARCHIVED CATALOG]

CS 552. Applied Complexity Theory

3.00

Algorithms (sorting and searching, graph theory, arithmetic) with space and time complexity and analyses; formal models of computation; theoretical aspects of computational complexity, including complexity measures and hierarchies, intractable problems, and the P=NP question. Other topics in theoretical computer science with applications. Prerequisite: Unconditional admission as a computer science graduate student.