Show that if P = NP, then every language A P, except A = and

Question:

Show that if P = NP, then every language A ∈ P, except A = ⌀ and A = Σ*, is NP-complete.

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

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: