| |
Apr 18, 2024
|
|
|
|
|
CS 6050 - Parallel Computation Theory
Topics in the theory of parallel computation are explored. Topics include the PRAM model, the Boolean circuit model, uniform circuit families, parallel complexity classes, reducibility, P-completeness, and the approximation of P-complete problems.
Requisites: CS 5040 or 5060
Credit Hours: 3
Repeat/Retake Information: May not be retaken.
Lecture/Lab Hours: 3.0 lecture
Grades: Eligible Grades: A-F,WP,WF,WN,FN,AU,I
Learning Outcomes:
- Students will be able to describe complexity classes associated with parallel and circuit models.
- Students will be able to analyze parallel algorithms for various parallel computing models.
- Students will be able to describe parallel models of computation.
- Students will be able to construct a proof of P-completeness.
- Students will be able to describe P-completeness.
- Students will be able to construct parallel algorithms for various parallel computing models.
Add to Portfolio (opens a new window)
|
|
