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

[[curator]]
I'm the Curator. I can help you navigate, organize, and curate this wiki. What would you like to do?