Home > Term: bounded error probability in polynomial time
bounded error probability in polynomial time
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
- Κλάδος/Τομέας: Υπολογιστές
- Category: Αλγόριθμοι & δομές
- Government Agency: NIST
0
Δημιουργός
- GeorgeV
-
(Gold) 1123 points - 100% positive feedback
