Question: MODEXP = {(a, b, c, p)| a, b, c, and p are positive binary integers such that a c (mod p)}. Show that MODEXPE


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.
Step by Step Solution
3.54 Rating (147 Votes )
There are 3 Steps involved in it
The detailed ... View full answer
Get step-by-step solutions from verified subject matter experts
