Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:complement |
RP
|
| gptkbp:contains |
P
NP |
| gptkbp:definedIn |
problems for which a probabilistic polynomial-time algorithm exists that never accepts a no-instance and accepts a yes-instance with probability at least 1/2
|
| gptkbp:hasSubgroup |
gptkb:BPP
|
| https://www.w3.org/2000/01/rdf-schema#label |
co-RP
|
| gptkbp:intersectionWith |
gptkb:ZPP
RP |
| gptkbp:introducedIn |
1980s
|
| gptkbp:relatedTo |
gptkb:BPP
gptkb:ZPP NP RP |
| gptkbp:usedIn |
theoretical computer science
theory of randomized algorithms |
| gptkbp:bfsParent |
gptkb:probabilistic_Turing_machine
|
| gptkbp:bfsLayer |
5
|