Statistical Algorithms and a Lower Bound for Detecting Planted Cliques (Q4640281): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2607171573 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1201.1214 / rank | |||
Normal rank | |||
Latest revision as of 19:30, 19 April 2024
scientific article; zbMATH DE number 6869318
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
