An oracle separating \(\oplus P\) from \(PP^{PH}\) (Q751272): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Relativized counting classes: Relations among thresholds, parity, and mods / rank | |||
Normal rank | |||
| 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: With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel computation with threshold functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of combinatorial problems with succinct input representation / rank | |||
Normal rank | |||
Latest revision as of 11:48, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An oracle separating \(\oplus P\) from \(PP^{PH}\) |
scientific article |
Statements
An oracle separating \(\oplus P\) from \(PP^{PH}\) (English)
0 references
1991
0 references
computational complexity
0 references
relativized complexity class
0 references
polynomial-time hierarchy
0 references
probabilistic polynomial time
0 references
threshld circuits
0 references
0 references
0 references
