COMP 506
3 credits
Advanced Analysis of Algorithms

Computer Science (Sci): The study of computational complexity and intractability: Cook's Theorem, NP-completeness, oracles, the polynomial hierarchy, lower bounds, heuristics, approximation problems.

Offered by: Computer Science