k-server conjecture proved true in new arXiv paper
iamsyr · hn · 2026-09-15
A new arXiv paper claims a proof of the k-server conjecture, the classic open problem in online algorithms posed in the 1990s about optimal strategies for serving requests across a metric space with k servers — a major result in theoretical computer science.
More from Research
- AI reads 2,000 historical illustrations: individual errors, near-perfect aggregate patterns — _akpiper · 2026-11-23
- ReLU networks have zero second derivative almost everywhere — why PINNs need smooth activations — bravo_abad · 2026-11-22
- Sinclair lab uses AI to find chemical age-reversal molecules, mouse tissues rejuvenated in 4 weeks — thederbiedone · 2026-11-22
- Aaronson on reported LLM proof of the Riemann Hypothesis: 17.4M lines of Lean code — jedisct1 · 2026-11-22
- Tufazip losslessly compresses 1GB Wikipedia to 105MB, best neural-network-only entry on LTCB — RichmanRonald · 2026-11-22
- Fine-tuned 2B models beat OpenAI o3 and Gemini 2.5 few-shot on molecular classification — madeofAjala · 2026-11-22