Complexity of Combinatorial Problems (3) NP-completeness theory; approximation and heuristic techniques; discrete scheduling; additional complexity classes.
Complexity of Combinatorial Problems (3)
General Education: None
Bachelor of Arts: None
Effective: Fall 1995
Prerequisite: CSE 565
Note : Class size, frequency of offering, and evaluation methods will vary by location and instructor. For these details check the specific course syllabus.