A composition theorem for decision tree complexity
Abstract
We completely characterise the complexity in the decision tree model of computing composite relations of the form h = g(f1,...,fn), where each relation fi 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.