Advanced
Theory of Computation
Q97 / 100
What is the complexity class BPP?
Correct! Well done.
Incorrect.
The correct answer is B) Bounded-error Probabilistic Polynomial time: problems solvable by a probabilistic TM in polynomial time with error probability ≤ 1/3
B
Correct Answer
Bounded-error Probabilistic Polynomial time: problems solvable by a probabilistic TM in polynomial time with error probability ≤ 1/3
Explanation
BPP allows at most 1/3 error probability on any input. P ⊆ BPP ⊆ PSPACE. It is widely believed BPP = P (derandomization conjecture), though unproven.
Progress
97/100