Zero-error Probabilistic Polynomial time
GPTKB entity
Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:abbreviation |
gptkb:ZPP
|
| gptkbp:closed |
closed under intersection
closed under union closed under complement |
| gptkbp:complexityHierarchy |
P ⊆ ZPP ⊆ BPP
|
| gptkbp:contains |
problems solvable in expected polynomial time with no error
|
| gptkbp:definedIn |
class of decision problems solvable by a probabilistic Turing machine in polynomial time with zero error probability
|
| gptkbp:equivalentTo |
RP ∩ co-RP
|
| https://www.w3.org/2000/01/rdf-schema#label |
Zero-error Probabilistic Polynomial time
|
| gptkbp:introducedIn |
gptkb:complexity_theory
|
| gptkbp:relatedTo |
gptkb:BPP
Randomized Polynomial time (RP) co-Randomized Polynomial time (co-RP) |
| gptkbp:bfsParent |
gptkb:ZPP
gptkb:ZPP_(complexity_class) |
| gptkbp:bfsLayer |
7
|