【2017年整理】04Complexity.pptVIP

Design and Analysis of Algorithms;Algorithm Design Patterns and Anti-Patterns;4.1 Polynomial-Time Reductions;Classify Problems According to Computational Requirements;Classify Problems;Polynomial-Time Reduction;Polynomial-Time Reduction;Reduction By Simple Equivalence;Independent Set;Vertex Cover;Vertex Cover and Independent Set;Vertex Cover and Independent Set;Reduction from Special Case to General Case;Set Cover;SET COVER U = { 1, 2, 3, 4, 5, 6, 7 }k = 2 Sa = {3, 7} Sb = {2, 4} Sc = {3, 4, 5, 6} Sd = {5}Se = {1} Sf= {1, 2, 6, 7};Polynomial-Time Reduction;4.2 Reductions via Gadgets;Ex: Yes: x1 = true, x2 = true x3 = false.;3 Satisfiability Reduces to Independent Set;3 Satisfiability Reduces to Independent Set;Review;Self-Reducibility;4.3 Definition of NP;Decision Problems;Definition of P;NP;Certifiers and Certificates: Composite;Certifiers and Certificates: 3-Satisfiability;Certifiers and Certificates: Hamiltonian Cycle;P, NP, EXP;The Main Question: P Versus NP;4.4 NP-Completeness;Polynomial Transformation;NP-Complete;?;sketchy part of proof; fixing the number of bits is important,and reflects basic distinction between algorithms and circuits;Establishing NP-Completeness;Observation. All problems below are NP-complete and polynomial reduce to one another!;Some NP-Complete Problems;Extent and Impact of NP-Completeness;More Hard Computational Problems;Basic genres. Packing problems: SET-PACKING, INDEPENDENT SET. Covering problems: SET-COVER, VERTEX-COVER. Constraint satisfaction problems: SAT, 3-SAT. Sequencing problems: HAMILTONIAN-CYCLE, TSP. Partitioning problems: 3D-MATCHING, 3-COLOR. Numerical problems: SUBSET-SUM, KNAPSACK.;Hamiltonian Cycle;Hamiltonian Cycle;Directed Hamiltonian Cycle;Directed Hamiltonian Cycle;3-SAT Reduces to Directed Hamiltonian Cycle;3-SAT Reduces to Directed Hamiltonian Cycle;3-SAT Reduces to Directed Hamiltonian Cycle;3-SAT Reduces to Directed Hamiltonian Cycle;3-SAT Reduces to Directed Hamiltonian Cycle;Longest Path