BPP and the polynomial hierarchy (Q1052094): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Relative to a Random Oracle<i>A</i>, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some observations on the probabilistic algorithms and NP-hard problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The polynomial-time hierarchy / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Randomised algorithms / rank | |||
Normal rank | |||
Revision as of 09:37, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | BPP and the polynomial hierarchy |
scientific article |
Statements
BPP and the polynomial hierarchy (English)
0 references
1983
0 references
complexity
0 references
probabilistic Turing machines
0 references
polynomial hierarchy
0 references
0 references
