  We study the probability of making an error if, by querying an oracle a fixed
number of times, we declare constant a randomly chosen n-bit
  Boolean function. We compare the classical and the quantum case, and we
determine for how many oracle-queries k and for how many bits n one querying
procedure is more efficient than the other.
