CS7150

Download as PDF

CS7150 - Computational Complexity - 3 - Credits

School of ComputingCollege of Engineering

Course Overview Course Learning Objectives

Course Prefix

Course Number

7150

Department

School of Computing

Course Title

Computational Complexity

Grade Mode

Standard Letter

Repeat Status

Course 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.

Credit Hours

Credit Hours Min

Registration Restrictions

Computer Science MPhD program

Prerequisite

Required

Earn a minimum grade of A- in the following:

Required

Earn a minimum grade of B+ in the following: