probabilistic complexity class
C52307
concept
A probabilistic complexity class is a set of decision problems that can be solved by a probabilistic Turing machine within specified resource bounds (such as time or space), with correctness guaranteed only with high probability rather than certainty.
Instances (1)
| Instance | Via concept surface |
|---|---|
|
complexity class RP
surface form:
RP
|
— |