A composition theorem for decision tree complexity
Computational Complexity
2013-02-19 v1
Abstract
We completely characterise the complexity in the decision tree model of computing composite relations of the form h = g(f^1,...,f^n), where each relation f^i is boolean-valued. Immediate corollaries include a direct sum theorem for decision tree complexity and a tight characterisation of the decision tree complexity of iterated boolean functions.
Keywords
Cite
@article{arxiv.1302.4207,
title = {A composition theorem for decision tree complexity},
author = {Ashley Montanaro},
journal= {arXiv preprint arXiv:1302.4207},
year = {2013}
}
Comments
7 pages