Let A 1 be any unary language Show that if A is NP complete, then P NP Consider a polynomial time reduction f from SAT to A For a formula , let 0100 be the reduced formula where variables x 1 , x 2 , x 3 , and x 4 in are set to the values 0, 1, 0, and 0, respectively What happens when you apply f t...

The Answer is in the image, click to view ...

Let A 1 * be any unary language. Show that if A is NP-complete, then P

Question:

Let A ⊆ 1^* be any unary language. Show that if A is NP-complete, then P = NP. Consider a polynomial time reduction f from SAT to A. For a formula ϕ, let ϕ₀₁₀₀ be the reduced formula where variables x₁, x₂, x₃, and x₄ in ϕ are set to the values 0, 1, 0, and 0, respectively. What happens when you apply f to all of these exponentially many reduced formulas?

Fantastic news! We've Found the answer you've been seeking!