Explicit bounded-depth chain-of-thought Transformer constructions compute DFS, Dijkstra, the Strahler number, and tree width from either tree or Dyck-path input.
Lemma 4.Let U be a vector space and letU′,U′′ be vector spaces withW=U ′⊕U′′
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Chain-of-Thought Shows the Path to a Tree: Realizing Branching Complexity
Explicit bounded-depth chain-of-thought Transformer constructions compute DFS, Dijkstra, the Strahler number, and tree width from either tree or Dyck-path input.