《NP近似11.pptVIP

Assignment 2 Lower Bound Arguments Trivial Lower Bounds Information-Theoretic Arguments Adversary Arguments Problem Reduction Lower Bound on Sorting Decision Trees Determining The Maximum Finding Max and Min NP - Completeness Why the theories ? Classifications Practice Optimization vs. Recognition Polynomially equivalent Problem Reduction and Transformation The TSP-optimization polynomially reduces to TSP-recognition I and III At least as hard as P, NP, NP-complete Certificate Proving NP-completeness Hamiltonian path problem vs. Hamiltonian cycle problem Longest path problem vs. Hamiltonian p