2436 search results - page 488 / 488 » Comonadic Notions of Computation |
148
Voted
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...