4 citations · 6 across the 8 of their papers we have counts for
1 paper · 1 filter
Stephen Cook, Pierre McKenzie, Dustin Wehr +2
We introduce the Tree Evaluation Problem, show that it is in logDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarithm…