MIT6_045JS11_lec16

MIT6_045JS11_lec16 - 6.045 Automata Computability and...

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 6.045: Automata, Computability, and Complexity (GITCS) Class 16 Nancy Lynch Today: More NP-Completeness • Topics: – 3SAT is NP-complete – Clique and VertexCover are NP-complete – More examples, overview – Hamiltonian path and Hamiltonian circuit – Traveling Salesman problem – More examples, revisited • Reading: – Sipser Sections 7.4-7.5 – Garey and Johnson • N e x t : – Sipser Section 10.2 3SAT is NP-Complete NP-Completeness • Definition: Language B is NP-complete if both of the following hold: (a) B ∈ NP, and (b) For any language A ∈ NP, A ≤ p B. • Definition: Language B is NP-hard if, for any language A ∈ NP, A ≤ p B. NP P 3SAT is NP-Complete • SAT = { < φ > | φ is a satisfiable Boolean formula } • Boolean formula: Constructed from literals using operations, e.g.: φ = x ∧ ( ( y ∧ z ) ∨ ( ¬ y ∧ ¬ z ) ) ∧ ¬ ( x ∧ z ) • A Boolean formula is satisfiable iff there is an assignment of 0s and 1s to the variables that makes the entire formula evaluate to 1 (true). • Theorem: SAT is NP-complete. • 3SAT: Satisfiable Boolean formulas of a restricted kind--- conjunctive normal form (CNF) with exactly 3 literals per clause. • Theorem: 3SAT is NP-complete. • Proof: – 3SAT ∈ NP: Obvious. – 3SAT is NP-hard: … 3SAT is NP-hard • Clause: Disjunction of literals, e.g., ( ¬ x 1 ∨ x 2 ∨ ¬ x 3 ) • CNF: Conjunction of such clauses • Example: ( ¬ x 1 ∨ x 2 ) ∧ ( x 1 ∨ ¬ x 2 ) ∧ ( x 1 ∨ x 2 ∨ ¬ x 3 ) ∧ ( x 3 ) • 3- C N F : { < φ > | φ is a CNF formula in which each clause has exactly 3 literals } • CNF-SAT: { < φ > | φ is a satisfiable CNF formula } • 3- S A T : { < φ > | φ is a satisfiable 3-CNF formula } = SAT ∩ 3-CNF • Theorem: 3SAT is NP-hard. • P r o o f : Show CNF-SAT is NP-hard, and CNF-SAT ≤ p 3SAT. CNF-SAT is NP-hard • Theorem: CNF-SAT is NP-hard. • P r o o f : – We won’t show SAT ≤ p CNF-SAT. – Instead, modify the proof that SAT is NP-hard, so that it shows A ≤ p CNF-SAT, for an arbitrary A in NP, instead of just A ≤ p SAT as before. – We’ve almost done this: formula φ w is almost in CNF. – It’s a conjunction φ w = φ cell ∧ φ start ∧ φ accept ∧ φ move . – And each of these is itself in CNF, except φ move . – φ move is: • a conjunction over all (i,j) • of disjunctions over all tiles • of conjunctions of 6 conditions on the 6 cells: x i,j,a1 ∧ x i,j+1,a2 ∧ x i,j+2,a3 ∧ x i+1,j,b1 ∧ x i+1,j+1,b2 ∧ x i+1,j+2,b3 CNF-SAT is NP-hard • S h o w A ≤ p CNF-SAT. • φ w is a conjunction φ w = φ cell ∧ φ start ∧ φ accept ∧ φ move , where each is in CNF, except φ move . • φ move is: – a conjunction ( ∧ ) over all (i,j) – of disjunctions ( ∨ ) over all tiles – of conjunctions ( ∧ ) of 6 conditions on the 6 cells: x i,j,a1 ∧ x i,j+1,a2 ∧ x i,j+2,a3 ∧ x i+1,j,b1 ∧ x i+1,j+1,b2 ∧ x i+1,j+2,b3 • We want just ∧ of ∨ ....
View Full Document

This note was uploaded on 12/26/2011 for the course ENGINEERIN 18.400J taught by Professor Prof.scottaaronson during the Spring '11 term at MIT.

Page1 / 60

MIT6_045JS11_lec16 - 6.045 Automata Computability and...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online