Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time (Q896557): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Importer (talk | contribs)
Changed an Item
Property / arXiv ID
 
Property / arXiv ID: 1304.7047 / rank
 
Normal rank

Revision as of 17:48, 18 April 2024

scientific article
Language Label Description Also known as
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references