CS 449 - Algorithms And Complexity

Institution:

Regis University

Subject:

Description:

Concentrates on NP-complete problems and the algorithms that solve NP-complete problems. Involves designing and analyzing algorithms from an efficiency point of view. Additional Prerequisite(s): or equivalent prerequisite required. Prerequisite(s): MT 360B;

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.regis.edu/

Phone Number:

(800) 388-2366 ext 2111

Regional Accreditation:

North Central 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.