A rerooting variant of Levin Tree Search matches the best subtask decomposition and visits at most O(q times the q-th root of T) nodes when plain LTS needs T.
Hart, Nils J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Exponential Speedups by Rerooting Levin Tree Search
A rerooting variant of Levin Tree Search matches the best subtask decomposition and visits at most O(q times the q-th root of T) nodes when plain LTS needs T.