1701 search results - page 341 / 341 » Computer Science and State Machines |
141
click to vote
FSTTCS
2009
Springer
15 years 9 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...