CSC 613 Combinatorial Algorithms and Intractability

Topics may include combinatorial algorithms, nondeterministic algorithms, classes P and NP, NP-hard and NP-complete problems, and intractability, and design techniques for fast combinatorial algorithms. Prerequisite: CSC 311