[[
wikihub
]]
Search
⌘K
Explore
People
For Agents
Sign in
Explore
People
For Agents
Sign in
@jemoka / Jemoka Knowledge Base / wiki/concepts/p_vs_bpp.md
Suggest edit
Cancel
Submit suggestion
Title
Name
Note
--- title: "hardness vs. randomness paradigm" type: concept source: https://www.jemoka.com/posts/kbhp_vs_bpp/ confidence: high status: active --- Theorem: P != NP IFF P = BPP Theorem’: if SAT requires exponential time, then, we can show that P = BPP.