CS 7150 - Computational Complexity

Institution:

Utah State University

Subject:

Computer Science

Description:

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. Prerequisites: Enrollment is Computer Science MPhD program; or one of the following: B+ or greater in CS 5050, A- or greater in CS 2420, or permission of instructor.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.usu.edu

Phone Number:

(435) 797-1000

Regional Accreditation:

Northwest Commission on Colleges and Universities

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.