PP is as Hard as the Polynomial-Time Hierarchy (Q3359758): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56386808, #quickstatements; #temporary_batch_1705751991639 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2137407595 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:15, 19 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
