High Parallel Complexity Graphs and Memory-Hard Functions (Q2941555)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6474763
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | High Parallel Complexity Graphs and Memory-Hard Functions |
scientific article; zbMATH DE number 6474763 |
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
0 references
0 references
0.9008915
0 references
0.8917223
0 references
0 references
