Weak lower bounds on resource-bounded compression imply strong separations of complexity classes (Q5212860)
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 7160593
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Weak lower bounds on resource-bounded compression imply strong separations of complexity classes |
scientific article; zbMATH DE number 7160593 |
Statements
Weak lower bounds on resource-bounded compression imply strong separations of complexity classes (English)
0 references
30 January 2020
0 references
Kolmogorov complexity
0 references
hardness magnification
0 references
minimum circuit-size problem
0 references
streaming algorithms
0 references
0.8035743832588196
0 references
0.8035016655921936
0 references
0.7998585104942322
0 references
0.799855649471283
0 references
0.7960611581802368
0 references
