PP is as Hard as the Polynomial-Time Hierarchy (Q3359758): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 10:53, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | PP is as Hard as the Polynomial-Time Hierarchy |
scientific article |
Statements
PP is as Hard as the Polynomial-Time Hierarchy (English)
0 references
1991
0 references
polynomial-time hierarchy
0 references
probabilistic Turing machine
0 references
