CS 6050 - Parallel Computation Theory

Topics in the theory of parallel computation 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.0
Repeat/Retake Information: May not be retaken.

Lecture/Lab Hours: 3.0 lecture

Eligible grades: A-F,WP,WF,FN,FS,AU,I