131 search results - page 27 / 27 » The complexity of Boolean functions from cryptographic viewp... |
FSTTCS
2009
Springer
14 years 2 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...