A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Derandomization of logarithmic space: $\mathsf L=\mathsf{RL}=\mathsf{BPL}$
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Hamilton's Revenge <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:algorithms, speed Levels:1
Category:Theoretical computer science Lean version:YES! ✔
Rate this game! 4.5 out of 5 (5,361 votes)

>>> How to Play <<<
Exact derandomization of logarithmic space: $\mathsf L=\mathsf{RL}=\mathsf{BPL}$. Proves $\mathsf L=\mathsf{RL}=\mathsf{BPL}$, 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.

>>> Level Select <<<
released 2026-09-23  |  7 theorems · 53 lemmas · 67 proofs · 55,488 words  |  PLAY LEVEL 1 »  (pdf)
We prove $\mathsf L=\mathsf{RL}=\mathsf{BPL}$, resolving the derandomization problem for polynomial-time randomized logarithmic space.

More Theoretical computer science Games!
Optimal-order randomized $k$-server on arbitrary metricsOne-sample matroid prophet inequalities against an almighty adversaryBeyond the square-root exponent for depth-three circuitsApproximate counting and the perfect-matching entropy conjecture
Approximate counting of common integer polymatroid basesSampling and counting contingency tables with arbitrary marginsUniform identity testing for noncommutative formulasUniform sparsest cut: hardness and semidefinite gaps

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games