High Parallel Complexity Graphs and Memory-Hard Functions (Q2941555): Difference between revisions
From MaRDI portal
Latest revision as of 15:56, 10 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | High Parallel Complexity Graphs and Memory-Hard Functions |
scientific article |
Statements
High Parallel Complexity Graphs and Memory-Hard Functions (English)
0 references
21 August 2015
0 references
cryptography
0 references
graph complexity
0 references
memory-hard functions
0 references
parallelism
0 references
pebbling
0 references
0 references