MODEXP = {(a, b, c, p)| a, b, c, and p are positive binary integers such...

Transcribed Image Text:

MODEXP = {(a, b, c, p)| a, b, c, and p are positive binary integers such that a c (mod p)}. Show that MODEXPE P. (Note that the most obvious algorithm doesn't run in polynomial time. Hint: Try it first where b is a power of 2.) 1.18 Show that if P = NP, then every language A P, except A = 0 and A = 2*, is NP-complete. MODEXP = {(a, b, c, p)| a, b, c, and p are positive binary integers such that a c (mod p)}. Show that MODEXPE P. (Note that the most obvious algorithm doesn't run in polynomial time. Hint: Try it first where b is a power of 2.) MODEXP = {(a, b, c, p)| a, b, c, and p are positive binary integers such that a c (mod p)}. Show that MODEXPE P. (Note that the most obvious algorithm doesn't run in polynomial time. Hint: Try it first where b is a power of 2.) 1.18 Show that if P = NP, then every language A P, except A = 0 and A = 2*, is NP-complete. 1.18 Show that if P = NP, then every language A P, except A = 0 and A = 2*, is NP-complete.

Answer rating: 100% (QA)

The detailed ... View the full answer