High Parallel Complexity Graphs and Memory-Hard Functions (Q2941555)

From MaRDI portal
Revision as of 15:56, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
High Parallel Complexity Graphs and Memory-Hard Functions
scientific article

    Statements

    title
    High Parallel Complexity Graphs and Memory-Hard Functions (English)
    0 references
    author
    Joël Alwen
    0 references
    Vladimir Serbinenko
    0 references
    publication date
    21 August 2015
    0 references
    zbMATH Keywords
    cryptography
    0 references
    graph complexity
    0 references
    memory-hard functions
    0 references
    parallelism
    0 references
    pebbling
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    94A60
    0 references
    68Q05
    0 references
    68Q10
    0 references
    68Q17
    0 references
    68W10
    0 references
    zbMATH DE Number
    6474763
    0 references
    OpenAlex ID
    W2072573758
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2941555&oldid=36197290"
    Powered by MediaWiki