Sciweavers

1701 search results - page 341 / 341
» Computer Science and State Machines
Sort
View
FSTTCS
2009
Springer
13 years 12 months ago
Fractional Pebbling and Thrifty Branching Programs
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...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...