Inicio > 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.
- Parte del discurso: noun
- Industria/ámbito: Ciencia informática
- Categoría: Algoritmos & Estructura de Datos
- Government Agency: NIST
0
Creador
- GeorgeV
-
(Gold) 1123 puntos - 100% positive feedback
