Statistical algorithms and a lower bound for detecting planted cliques (Q4640281)
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: Statistical algorithms and a lower bound for detecting planted cliques |
scientific article; zbMATH DE number 6869318
| 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 6869318 |
Statements
Statistical Algorithms and a Lower Bound for Detecting Planted Cliques (English)
0 references
17 May 2018
0 references
learning theory
0 references
lower bounds
0 references
planted clique
0 references
statistical algorithms
0 references
statistical dimension
0 references
0.9839637875556946
0 references
0.8000232577323914
0 references
0.7979609966278076
0 references
0.785184919834137
0 references
