Also known as bounded-error probabilistic polynomial time, BPP complexity class
clase de complejidad
In the Vinony graph
Vinony's link graph records 110 inbound references to BPP, and connects out to NP-complete, time complexity and randomized algorithm.
It is catalogued under the topic Probabilistic complexity classes.
Vinony links it to 16 Wikipedia language editions.
Wikidata facts
- Instance of
- complexity class
- Subclass of
- computational problem
- Has part
- RP
Sources (2)
via Wikidata · CC0
Connections
NP-complete
Entity
time complexity
Entity
randomized algorithm
Entity
polynomial hierarchy
Entity
P/poly
Entity
Arthur–Merlin protocol
Entity
International Standard Book Number
Entity
prime number
Entity
probability
Entity
Wayback Machine
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
Turing machine
Entity
subset
Entity
mathematical constant
Entity
conjecture
Entity
quantum computing
Entity
computational complexity theory
Entity
Semantic Scholar
Entity
Leonard Adleman
Entity