Skip to main content

All Questions

Filter by
Sorted by
Tagged with
5 votes
2 answers
418 views

Is the Balanced Boolean Formula problem solvable in sublogarithmic space if the input has a tree structure?

Suppose that instead of the usual linear work tape the input is given in a binary tree structure with n leaves and log n depth, the initial position being the root. At every node, we can step to its ...
domotorp's user avatar
  • 14.2k