Apr 30, 2024  
OHIO University Graduate Catalog 2007-09 
    
Catalog Navigation
  Catalog Home
  Academic Policies and Procedures
  Services for Students
  Financial Aid
  Fees, Insurance, and Residency for Tuition Purposes
  Academic Organization
  Academic Units
  Programs of Study by Academic Unit
  Programs
  Guide to Course Listings
  Courses
  Departmental Faculty
  Application and Admission
  University Profile, Vision, Mission, & History
  Diversity Commitment
  General Information
  Student Records Policy
  Ohio Residency Policy
  Contact Information
  Copyright and Disclaimer
  My Portfolio
HELP
OHIO University Graduate Catalog 2007-09 [Archived Catalog]

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

C S 606 - Computational Complexity

The complexity of computational problems is explored with respect to a variety of complexity measures. Topics of study include deterministic time complexity, nondeterministic time complexity, the polynomial-time hierarchy, averagecase time complexity, space-bounded complexity, circuit complexity, reductions, relativizations, and parallel models of computation.

Prerequisites
Prereq: 506.

Credits: (4)
Instructors
Juedes.


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