Accueil > 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.
- Partie du discours : noun
- Secteur d’activité/Domaine : Informatique
- Catégorie : Algorithms & data structures
- Government Agency: NIST
0
Créateur
- GeorgeV
-
(Gold) 1123 points - 100% positive feedback
