Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time (Q896557)
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: Finding hidden cliques of size N/e in nearly linear time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time |
scientific article |
Statements
Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time (English)
0 references
10 December 2015
0 references
random graphs
0 references
average case complexity
0 references
approximate message passing
0 references
belief propagation
0 references
local algorithms
0 references
sparse recovery
0 references
0 references
0 references
0 references
0.9461432
0 references
0.9461432
0 references
0.9001938
0 references
0.88780284
0 references
0.88780284
0 references
