CS 759 Complexity Theory 3.0 Credits
Introduces formal models of computation, including inherent difficulty of various problems, lower bound theory, polynomial reducibility among problems, Cook's theorem, NP-completeness, and approximation strategies.
Repeat Status: Not repeatable for credit
Prerequisites: CS 525 [Min Grade: C]