216 search results - page 44 / 44 » Exact Algorithms for L (2, 1)-Labeling of Graphs |
FSTTCS
2009
Springer
14 years 15 days 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...