High Parallel Complexity Graphs and Memory-Hard Functions (Q2941555): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/2746539.2746622 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2072573758 / rank | |||
Normal rank | |||
Revision as of 18:52, 19 March 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
