In the previous chapters, the complexity classes concerned problems which could be solved by procedures without error. We now consider probabilistic procedures such that if x ∈L, the probability to accept will be close to 1 and if x ∉L, the probability to reject will be close to 1.
KeywordsError Probability Perfect Match Turing Machine Probabilistic Classis Computation Tree
Unable to display preview. Download preview PDF.