Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
Jain, Rahul · Klauck, Hartmut · Santha, Miklos
Original · EN
A Direct Sum Theorem holds in a model of computation, when solving some k input instances together is k times as expensive as solving one. We show that Direct Sum Theorems hold in the models of deterministic and randomized decision trees for all relations. We also note that a near optimal Direct Sum Theorem holds for quantum decision trees for boolean functions.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.