CMSI 475 Computational Complexity

3 semester hours

Introduction to the study of computational complexity, including efficient algorithms for matrix multiplication and fast Fourier transforms, the classes P and NP, approximation algorithms, randomized algorithms and RP, parallel algorithms and NC.

Lecture, 3 hours.

Prerequisites: CMSI 282  and CMSI 385 .

Print-Friendly Page.Print-Friendly Page