Feb 10, 2025  
Ohio University Graduate Catalog 2015-2017 
    
Catalog Navigation
  Catalog Home
  Application, Admission and Adding Degrees
  Academic Policies and Procedures
  Fees & Ohio Residency
  Graduate Funding and Financial Aid
  Degree Requirements
  Academic Units
  Programs of Study by Academic Unit
  Programs
  Course Information
  Courses
  Departmental Faculty
  University Profile, Vision, Mission, & History
  Diversity Commitment
  Notice of Non-Discrimination
  Copyright and Disclaimer
  Services and Resources
  My Portfolio
HELP
Ohio University Graduate Catalog 2015-2017 [Archived Catalog]

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

CS 6060 - Computational Complexity

Complexity of computational problems explored with respect to a variety of complexity measures. Topics iinclude deterministic time complexity, nondeterministic time complexity, the polynomial-time hierarchy, average-case time complexity, space-bounded complexity, circuit complexity, reductions, relativizations, and parallel models of computation.

Requisites
CS 5060
Credit Hours: 3.0
Repeat/Retake Information: May not be retaken.

Lecture/Lab Hours: 3.0 lecture

Eligible grades: A-F,WP,WF,FN,FS,AU,I


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