Why do simple algorithms for triangle enumeration work in the real world? (Q2988883): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4526993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Width Two Branching Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Leveled) fully homomorphic encryption without bootstrapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Fully Homomorphic Encryption from (Standard) LWE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully homomorphic encryption using ideal lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for hard lattices and new cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Branching Programs on Encrypted Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-key cryptosystems from the worst-case shortest vector problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lattice-based cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of polynomial time lattice basis reduction algorithms / rank
 
Normal rank

Latest revision as of 21:10, 13 July 2024

scientific article
Language Label Description Also known as
English
Why do simple algorithms for triangle enumeration work in the real world?
scientific article

    Statements

    Why do simple algorithms for triangle enumeration work in the real world? (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 May 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    expected analysis
    0 references
    graph algorithms
    0 references
    heavy-tailed degree distribution
    0 references
    triangle enumeration
    0 references
    0 references