Apr 19, 2024  
2021-2022 General Catalog 
    
Catalog Navigation
  Catalog Home
  Academics
  General Education & University Studies
  Academic & Registration Calendars
  University Policies and Procedures
  School of Graduate Studies (Policy)
  Departments
  Programs
  Courses
  Student and Enrollment Services
  Schedule of Classes (external link)
  Campus Services
  2020-2021 Academic Calendar
  Campus Maps
  Disclaimer
  Archived Catalogs
  Registration Requirement
  Spring Semester 2022 Final Examination Schedule
  Library Faculty
HELP
2021-2022 General Catalog ARCHIVED CATALOG: To search archives, MUST use search box to left. Current catalog: catalog.usu.edu.

Facebook this Page (opens a new window)
Tweet this Page (opens a new window)

CS 7150 - Computational Complexity

3 credits

Focuses on central concepts in theoretical computer science, including NP-hardness, reductions, approximation algorithms, and fixed parameter algorithms. Samples modern algorithmic topics such as streaming, online, randomized, probabilistic, distributed, and quantum computations. Studies hard computational problems in both combinatorial and geometric settings.

Prerequisite/Restriction: Enrollment is Computer Science MPhD program; or one of the following: B+ or greater in CS 5050 , A- or greater in CS 2420 , or instructor permission


Facebook this Page (opens a new window)
Tweet this Page (opens a new window)