PP is as Hard as the Polynomial-Time Hierarchy (Q3359758): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56386808, #quickstatements; #temporary_batch_1705751991639 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56386808 / rank | |||
Normal rank | |||
Revision as of 13:13, 20 January 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
