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 the normal view instead:
scientific article; zbMATH DE number 4213445
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | PP is as Hard as the Polynomial-Time Hierarchy |
scientific article; zbMATH DE number 4213445 |
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
0.8419913053512573
0 references
0.8183814883232117
0 references
0.80291348695755
0 references
0.80291348695755
0 references
