Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
Computational Complexity
2010-04-02 v1 Quantum Physics
Abstract
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.
Keywords
Cite
@article{arxiv.1004.0105,
title = {Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity},
author = {Rahul Jain and Hartmut Klauck and Miklos Santha},
journal= {arXiv preprint arXiv:1004.0105},
year = {2010}
}
Comments
7 pages