ホーム > Term: bounded error probability in polynomial time (BPP)
bounded error probability in polynomial time (BPP)
The class of languages for which a membership computation by a probabilistic Turing machine halts in polynomial time with the right answer (accept or reject) at least 2/3 of the time.
- スピーチの一部 noun
- 産業/ドメイン コンピュータサイエンス
- カテゴリ Algorithms & data structures
- Government Agency: NIST
0
作成者
- GeorgeV
-
(Gold) 1123 ポイント - 100% positive feedback
