Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:contains |
all problems solvable by both RP and co-RP algorithms
|
| gptkbp:definedIn |
class of decision problems solvable by a probabilistic Turing machine in expected polynomial time with zero error
|
| gptkbp:equivalentTo |
RP ∩ co-RP
|
| gptkbp:hasErrorProbability |
zero
|
| gptkbp:hasExpectedRunningTime |
gptkb:algebra
|
| gptkbp:hasSubgroup |
gptkb:BPP
P |
| https://www.w3.org/2000/01/rdf-schema#label |
ZPP (complexity class)
|
| gptkbp:introducedIn |
1970s
|
| gptkbp:relatedTo |
gptkb:P_(complexity_class)
gptkb:BPP_(complexity_class) gptkb:RP_(complexity_class) co-RP (complexity class) |
| gptkbp:standsFor |
gptkb:Zero-error_Probabilistic_Polynomial_time
|
| gptkbp:usedIn |
theoretical computer science
|
| gptkbp:bfsParent |
gptkb:NP_(complexity_class)
gptkb:P_(complexity_class) |
| gptkbp:bfsLayer |
6
|