CS 613 - Advanced Computational Complexity

Institution:

California State University-San Marcos

Subject:

Description:

In-depth discussion of computational complexity theory including models of computation, polynomially bounded, NPcompleteness, reducibility, and beyond NPcompleteness, and intractable problems. NP-complete problems in various areas will be discussed. Prerequisites: CS 513 and 521.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.csusm.edu

Phone Number:

(760) 750-4000

Regional Accreditation:

Western Association of Schools and Colleges

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.