Combinatorial                                  algorithms, nondeterministic algorithms, classes                                  P and NP, NP-hard and NP-complete problems, and                                  intractability. Design techniques for fast                                  combinatorial algorithms. Prerequisite: CSE 450.