CSC 511 Computational Complexity
Examination of computer algorithms from the point of view of computational complexity. Topics include polynomial algorithms, FFT and GCD; algorithms for vector and parallel machines, pipelines, and systolic arrays; NP completeness. Prerequisite:
CSC 210.