Better path-finding algorithms in LPS Ramanujan graphs (Q1755951): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Optimal ancilla-free Pauli+V circuits for axial rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Modular Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic hash functions from expander graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth and generation in \(\text{SL}_2(\mathbb{Z}/p\mathbb{Z})\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full Cryptanalysis of LPS and Morgenstern Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Strong Approximation on the Sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collisions for the LPS Expander Graph Hash Function / rank
 
Normal rank

Revision as of 20:01, 17 July 2024

scientific article
Language Label Description Also known as
English
Better path-finding algorithms in LPS Ramanujan graphs
scientific article

    Statements

    Better path-finding algorithms in LPS Ramanujan graphs (English)
    0 references
    0 references
    0 references
    11 January 2019
    0 references
    cryptography
    0 references
    Cayley graph
    0 references
    Tillich-Zémor hash function
    0 references
    path finding algorithm
    0 references

    Identifiers