Computational barriers to estimation from low-degree polynomials (Q2149001)
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: Computational barriers to estimation from low-degree polynomials |
scientific article; zbMATH DE number 7547952
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational barriers to estimation from low-degree polynomials |
scientific article; zbMATH DE number 7547952 |
Statements
Computational barriers to estimation from low-degree polynomials (English)
0 references
24 June 2022
0 references
computational complexity
0 references
low-degree polynomials
0 references
planted dense subgraph
0 references
planted submatrix
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7717645764350891
0 references
0.766692578792572
0 references
0.7500525116920471
0 references
