Unformatted text preview: A. L = {h M i : M accepts some evenlength string } . B. L = {h M i : M accepts some palindrome } . C. L = {h M i : M never prints a “0” (regardless of the input) } . D. L = {h φ i : φ is a Boolean formula which has no satisfying assignment } . Problem 3. Suppose you are given a polynomial time algorithm which, on input of a Boolean formula φ , decides if φ is satisﬁable. Describe an eﬃcient procedure which ﬁnds a satisfying assignment for φ . Problem 4. Prove that if P = NP then ∀ A ∈ P \ {∅ , Σ * } , A is NPcomplete. Problem 5. Prove that DOUBLESAT= {h φ i φ has at least two satisfying assignments } is NPcomplete. 1...
View
Full Document
 Spring '10
 mr.
 Computational complexity theory, The Matrix Reloaded, The Matrix Revolutions, satisfying assignment

Click to edit the document details