A New Gap Sequence for Shellsort: RL-Driven Algorithm Discovery Beyond N 4/3

arXiv:2609.29881 · cs.CC, cs.DS, cs.LG · Submitted 2026-09-24 · Read on arXiv

cs.CC, cs.DS, cs.LG

Submitted: 2026-09-24

Updated: 2026-09-24

Terminology

• Reinforcement Learning — 4× in this paper · explained in 4 episodes
• Trace — 3× in this paper · explained in 2 episodes
• Transformer — 3× in this paper · explained in 2 episodes
• Fine-Tuning — 2× in this paper · explained in 5 episodes
• Benchmark — 1× in this paper · explained in 2 episodes
• Generalization — 1× in this paper · explained in 13 episodes

Sources

• Improved lower bounds of the time complexity of shellsort

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