56+Slides--More+on+Complexity

56+Slides--More+on+Complexity - CS103 HO#56 Slides--More on...

Info iconThis preview shows pages 1–2. 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
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS103 HO#56 Slides--More on Complexity 6/1/11 1 CS103 Mathematical Foundations of Computing 6/1/11 FINAL EXAM: Monday, June 6, 12:15 – 3:15 Braun Auditorium More on Complexity DOUBLE-SAT = { Φ | Φ is a Boolean formula with two satisfying assignments} Show that DOUBLE-SAT is NP-complete. 1. DOUBLE-SAT NP since ... 2. We can show SAT ≤ p DOUBLE-SAT with the TM F that computes a polynomial time reduction f: F = "On input Φ , where Φ is a Boolean formula with variables x 1 , x 2 , ... , x m : ... " So Φ SAT if and only if f( Φ ) DOUBLE-SAT. More on Complexity DOUBLE-SAT = { Φ | Φ is a Boolean formula with two satisfying assignments} Show that DOUBLE-SAT is NP-complete. 1. DOUBLE-SAT NP since two assignments can be verified in polynomial time. 2. We can show SAT ≤ p DOUBLE-SAT with the TM F that computes a polynomial time reduction f: F = "On input Φ , where Φ is a Boolean formula with variables x 1 , x 2 , ... , x m : 1. Let Φ ' be Φ (x ¬x) where x is a new variable. 2. Output Φ ' ." So Φ SAT if and only if f( Φ ) DOUBLE-SAT. More on Complexity DOUBLE-SAT = { Φ | Φ is a Boolean formula with two satisfying assignments} Show that DOUBLE-SAT is NP-complete. 1. DOUBLE-SAT NP since two assignments can be verified in polynomial time. 2. We can show SAT ≤ p DOUBLE-SAT with the TM F that computes a polynomial time reduction f: F = "On input Φ , where Φ is a Boolean formula with variables x 1 , x 2 , ... , x m : 1. Let Φ ' be Φ (x ¬x) where x is a new variable. 2. Output Φ ' ." If Φ SAT, then Φ ' has at least two satisfying assignments: the original satisfying assignment with x = T and x = F. If Φ ' DOUBLE-SAT, then Φ is satisfiable since x does not appear in Φ . So Φ SAT if and only if f( Φ ) DOUBLE-SAT. More on Complexity The Circuit-Satisfiability Problem A Boolean circuit is a collection of AND, OR, and NOT gates connected by wires, with no loops....
View Full Document

This document was uploaded on 07/18/2011.

Page1 / 5

56+Slides--More+on+Complexity - CS103 HO#56 Slides--More on...

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

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