We shall consider the general method, employed by an adversa…
We shall consider the general method, employed by an adversary, to prove that no algorithm can always decide a given problem X using less than M questions. For that purpose, the adversary maintains Q, and R_1 … R_M, such that : 1. X(Q) is false2. X(R_i) is true for all i \in 1 … M and such that after k questions from the algorithm:3. Q is consistent with all k answers from the adversary 4. for all i in 1 … M, except for at most k such, it holds that R_i is consistent with all k answers from the adversary.For each declaration from the algorithm, how should the adversary respond?
Read Details