Theoretical computer science · Oct 6, 2026
Logspace derandomization
Proves , resolving derandomization for bounded-error logarithmic-space computation. An effective compiler converts each randomized polynomial-time logarithmic-space machine deciding a language with one-sided or two-sided error into a deterministic logarithmic-space decider with explicit polynomial running-time bounds.
Scope and what remains
Not P=BPP and not a P versus NP resolution.
Contributors
OpenAI source publisher and an unnamed unreleased internal model. Exact paper-level human roles are not disclosed by the family summary.
AI systems: Unreleased OpenAI model