Statistical algorithms and a lower bound for detecting planted cliques (Q5495836)
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 6327000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Statistical algorithms and a lower bound for detecting planted cliques |
scientific article; zbMATH DE number 6327000 |
Statements
Statistical algorithms and a lower bound for detecting planted cliques (English)
0 references
7 August 2014
0 references
lower bounds
0 references
planted clique
0 references
statistical algorithms
0 references
statistical query
0 references
0.9839637875556946
0 references
0.8089198470115662
0 references
0.7953459620475769
0 references
0.7951144576072693
0 references
0.7907981872558594
0 references
