> BPP is the complexity class for decision problems that a randomized algorithm can solve in polynomial time, in the sense that on every input (worst-case), the algorithm is right with at least 2/3 probability (over its own randomness).
What's the theoretical significance of the 2/3 threshold?
What's the theoretical significance of the 2/3 threshold?