PP is as Hard as the Polynomial-Time Hierarchy (Q3359758)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: PP is as Hard as the Polynomial-Time Hierarchy |
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
