High Parallel Complexity Graphs and Memory-Hard Functions.
Joël AlwenVladimir SerbinenkoPublished in: IACR Cryptol. ePrint Arch. (2014)
Keyphrases
- memory requirements
- wide range
- memory bandwidth
- pruning power
- parallel hardware
- parallel processing
- space complexity
- memory usage
- graph matching
- computational complexity
- distributed shared memory
- level parallelism
- memory footprint
- processing elements
- graph theoretic
- computational power
- parallel implementation
- shared memory
- graph mining
- basis functions
- worst case
- graph representation
- massively parallel
- small world
- multi threaded
- representational power
- graph theory
- compute intensive
- bipartite graph
- main memory