William Hoza breaks down the BPL=L result in complexity theory
thomasahle · x · 2026-11-02
A pointer to William Hoza's writeup on the BPL=L result: randomized log-space computation (BPL) equals deterministic log-space (L), a landmark derandomization result in complexity theory.
More from Research
- Thurston's 1994 warning revived: theorem-credit culture may hurt math as AI automates proofs — alexbilz · 2026-11-02
- AI text detection study: input:output length ratio raises miss rate by at most 5% — amplifiedamp · 2026-11-02
- Blogger Speculates on a Continual Learning Architecture Combining Multi-Stream LLMs and ECHO — joey072shx · 2026-11-02
- L3G-World Generates Minute-Long Consistent Worlds From a Single Image — Crazy-Repeat-2006 · 2026-11-02
- Fortnow revisits 3SUM, APSP and ETH: why complexity conjectures are believed — fortnow · 2026-11-02
- Why LLM steerability beats specialized models in generative bio design pipelines — chaitjo · 2026-11-02