This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis is an unformatted preview. Sign up to view the full document.
View Full Document3/24/08 - NP-complete sequencing pro... NP: problems whose solution can be e f ciently (poly-time) verifed. Ex: Compositeness: Given n-bit number x, in x composite? Hint: a pair y,z > 1 such that yz = x. NP-Complete: a problem X which is in NP and every other problem Y in NP has a poly-time reduction FROM Y TO X. Ex. Ind. Set, 3 SAT. Alt de: a problem X which is in NP and there exists NPC problem Y which has a poly-time reduction rom Y to X. 2 easy reductions rom ind. set. (1) CLIQUE: Given undirected graph G = (V, E) and a number k > 0. Output yes i G has a subgraph H with k vertices and every 2 vertices o H are joined by an edge. (H is a k-clique.) Take (G, k) an instance o IND. SET. Construct G which has same vertex set and (u,v) E(G ) <=> (u,v) E(G). (1) Reduction runs in poly-time. YES! O(n 2 ) (2) I G has k-ind set, G has a k-clique.... View Full Document
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document08 - NP-complete partitioning problems- 3-dimensional matching
08 - NP-complete coloring problems- 3-coloring
08 - Divide and conquer algorithms in computational geometry- finding the closest pair of points
08 - Introduction to dynamic programming; weighted interval scheduling
sol7
sol_prelim2
lec20
quiz 7
lec33-35
hw30
completeness theorem
a6_solution
Copyright © 2015. Course Hero, Inc.
Course Hero is not sponsored or endorsed by any college or university.