Ben-David, Shalev
[VerfasserIn];
Göös, Mika
[VerfasserIn];
Kothari, Robin
[VerfasserIn];
Watson, Thomas
[VerfasserIn]
;
Shalev Ben-David and Mika Göös and Robin Kothari and Thomas Watson
[MitwirkendeR]
When Is Amplification Necessary for Composition in Randomized Query Complexity?
Anmerkungen:
Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
Beschreibung:
Suppose we have randomized decision trees for an outer function f and an inner function g. The natural approach for obtaining a randomized decision tree for the composed function (f∘ gⁿ)(x¹,…,xⁿ) = f(g(x¹),…,g(xⁿ)) involves amplifying the success probability of the decision tree for g, so that a union bound can be used to bound the error probability over all the coordinates. The amplification introduces a logarithmic factor cost overhead. We study the question: When is this log factor necessary? We show that when the outer function is parity or majority, the log factor can be necessary, even for models that are more powerful than plain randomized decision trees. Our results are related to, but qualitatively strengthen in various ways, known results about decision trees with noisy inputs.