Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

30

CORR
2010
Springer

favoriteEmaildiscussreport

109views Education» more CORR 2010»

Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity

13 years 11 months ago

Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity

Download www.comp.nus.edu.sg

A Direct Sum Theorem holds in a model of computation, when for every problem 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.

Rahul Jain, Hartmut Klauck, Miklos Santha

Real-time Traffic

CORR 2010 | Direct Sum Theorem | Education | Input Instances | Optimal Direct Sum |

claim paper

Related Content

» Randomized vsDeterministic Decision Tree Complexity for ReadOnce Boolean Functions

» An Efficient Algorithm for EasyFirst NonDirectional Dependency Parsing

» Weak Derandomization of Weak Algorithms Explicit Versions of Yaos Lemma

» New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques

» Lower Bounds on the Randomized Communication Complexity of ReadOnce Functions

» Lower Bounds Using Kolmogorov Complexity

» Classification of premalignant pancreatic cancer massspectrometry data using decision tree...

» Grammatical Evolution Decision Trees for Detecting GeneGene Interactions

» A Direct Product Theorem for Discrepancy

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Rahul Jain, Hartmut Klauck, Miklos Santha

Comments (0)