---
title: "hardness vs. randomness paradigm"
source: https://www.jemoka.com/posts/kbhp_vs_bpp/
---

Theorem: P != NP IFF P = BPP Theorem&rsquo;: if SAT requires exponential time, then, we can show that P = BPP.
