Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > TREE EVALUATION PROBLEM:
Reports tagged with tree evaluation problem:
TR20-056 | 17th April 2020
James Cook, Ian Mertz

The study of branching programs for the Tree Evaluation Problem, introduced by S. Cook et al. (TOCT 2012), remains one of the most promising approaches to separating L from P. Given a label in $[k]$ at each leaf of a complete binary tree and an explicit function in $[k]^2 \to ... more >>> TR21-054 | 14th April 2021 James Cook, Ian Mertz #### Encodings and the Tree Evaluation Problem We show that the Tree Evaluation Problem with alphabet size$k$and height$h$can be solved by branching programs of size$k^{O(h/\log h)} + 2^{O(h)}\$. This answers a longstanding challenge of Cook et al. (2009) and gives the first general upper bound since the problem's inception.

more >>>

ISSN 1433-8092 | Imprint