On the complexity of the single-move labeled token routing problem

arXiv:2610.09084 · cs.CC, cs.DM, cs.DS, cs.RO, math.CO · Submitted 2026-10-06 · Read on arXiv

cs.CC, cs.DM, cs.DS, cs.RO, math.CO

Submitted: 2026-10-06

Updated: 2026-10-06

Terminology

• Filler Tokens — 9× in this paper · explained in 2 episodes
• Annual Symposium on Foundations of Computer Science — 1× in this paper
• Benchmark — 1× in this paper · explained in 2 episodes

Sources

• Ten Problems in Geobotics
• Reconfiguration of Squares Using a Constant Number of Moves Each

Related papers

• Parameterized Hardness of Zonotope Containment and Neural Network Verification
• Hardware-Algorithm Co-Optimization of Early-Exit Neural Networks for Multi-Core Edge Accelerators
• Quantum Fine-Grained Lower Bounds for SetDisjointness via Sub-Linear Reductions from 3SUM
• Strassen's support functionals coincide with the quantum functionals
• Exponential Quantum Advantage in Numbers-on-Forehead Communication
• Rational degree is polynomially related to degree