COSC 5200 - Comp Complexity

Institution:

University of Wyoming

Subject:

COSC

Description:

Formalization of the notion of inherent intractability of a problem and efficiency criteria of an algorithm. Models of computation. Equivalence of models. Classes P, NP, PSPACE. Techniques for proving previous problems NP-complete. Approximation algorithms. Efficient algorithms for sets and partitioning UNION-FInd, matrix multiplication, graph problems. Modular arithmetic. Models of parallel computation and parallel algorithms. Prerequisite: COSC 4100 or consent of instructor. (Offered fall semester of odd numbered years.)

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.uwyo.edu

Phone Number:

(307) 766-1121

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.