Can one find a natural number N in less than O(log(N))O(log(N))O(log(N)) time if one is allowed to ask whether any given integer is ≤≤leqN?
SupportExpert
Can one find a natural number N in less than O(log(N))O(log(N))O(log(N)) time if one is allowed to ask whether any given integer is ≤≤leqN?
Share