Question: [34] We construct a sparse random oracle set A as follows: For every n, n = 1, 2,... , toss a fair coin. If the
[34] We construct a sparse random oracle set A as follows: For every n, n = 1, 2,... , toss a fair coin. If the result is ‘tails,’ then we do not include any string of length n in A; if the result is ‘heads,’ then we toss the coin n times and place the resulting binary string (the ith bit is 1 iff the ith toss is heads) in A. Prove that Pr(NPA = PA) = 1.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
