Codebased Challenge For Automated Openended Mathematical Discovery Based On The Kserver Conjecture
1 mentions across 0 people
All mentions
Unknown speaker
Recommendedpaper · 2026-04-09
“We introduce a code-based challenge for automated, open-ended mathematical discovery based on the $k$-server conjecture, a central open problem in competitive analysis. The task is to discover a potential function satisfying a large graph-structured system of simple linear inequalities.”
Automated Discovery for the k-Server Conjecture Poses a Challenging Benchmark ↗