CS6369 - Complexity of Combinatorial Algorithms

CS 6369 Complexity of Combinatorial Algorithms (3 semester hours) Topics include bounded reducibility and completeness, approximation algorithms and heuristics for NP-hard problems, randomized algorithms, additional complexity classes. Prerequisite: CS 6363. (3-0) T