CS 542 - Computational Complexity

Institution:

Clarkson University

Subject:

Description:

The complexity of a computational problem is the amount of computer resources it requires. Computational complexity theory studies the complexity of computational problems as well as relationships between different types of resources. This course will cover both classical and research-related topics in computational complexity, such as: complexity measures and complexity classes for sequential machines and Boolean circuits, reductions and completeness, hierarchy theorems, relativization, circuit complexity, and proof complexity. Students will be expected to independently explore some of the course material. Prerequisites: CS345 or CS541, or consent of the instructor.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.clarkson.edu

Phone Number:

(315) 268-6400

Regional Accreditation:

Middle States Association of Colleges and Schools

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.