Chicago Journal of Theoretical Computer Science

Volume 2014

Article 6

Published by the Department of Computer Science, The University of Chicago.

A composition theorem for decision tree complexity

Ashley Montanaro
Department of Computer Science
University of Bristol
Bristol, UK
ashley AT cs DOT bris DOT ac DOT uk

July 17, 2014


We completely characterise the complexity in the decision tree model of computing composite relations of the form $h = g \circ (f^1,\dots,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.

Submitted March 1st 2013, revised June 25, 2013 and in final form July 15, 2014, published July 17, 2014.

DOI: 10.4086/cjtcs.2014.006

[] Article 5 [] Article 7
[back] Volume 2014 [back] Published articles
[CJCTS home]