Quasi-Riemann Result Puts Deterministic Miller-Rabin in P, a Newly Solved Open Problem
geoffreyirving · x · 2026-10-15
Geoffrey Irving notes a corollary of last week's quasi-Riemann result: deterministic Miller-Rabin is now in P, an open problem until recently. Estimated complexity: O((log n)^9.9984 · (log log n)^(-8.3×10⁻¹¹)).
Related event: Deterministic Miller-Rabin Falls Into P After Quasi-Riemann Breakthrough(2 posts)→
More from Research
- Intern-S2 credited in math paper as post-trained Qwen 3.5-397B, sparking AI-for-math debate — teortaxesTex · 2026-10-15
- DecisionRobust benchmark stress-tests 30 decision models against prompt injection and perturbations — Yifan Lan · 2026-10-15
- Continuum Attention: continuous integration beats softmax attention in all paired comparisons — Afshin Khadangi · 2026-10-15
- Microsoft's LensErase: a foundation model for erasing anything from images — microsoft · 2026-10-15
- LatentLoop: asymmetric compute for looped MoE saves 19% FLOPs — Zefeng He · 2026-10-15
- SJTU: VLA skill recombination fails at the "start state gap" — AutoLab-SJTU · 2026-10-15