Preprint
Sep 2026
Should Tables Be Sorted? Revisited with a Large Language Model
The implicit membership problem in Yao's full-table model is revisited and the first quantitative improvements to his 45-year-old Ramsey bounds are obtained, most notably reducing the two-probe bound from tower-type to polynomial.
Song-Hua He
· 0 citations