Hardness and hierarchy theorems for probabilistic quasi-polynomial time (Q2819602)
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 6631121
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness and hierarchy theorems for probabilistic quasi-polynomial time |
scientific article; zbMATH DE number 6631121 |
Statements
Hardness and hierarchy theorems for probabilistic quasi-polynomial time (English)
0 references
29 September 2016
0 references
0.8211603760719299
0 references
0.7602289319038391
0 references
0.7404608130455017
0 references
