High Parallel Complexity Graphs and Memory-Hard Functions.
Joël AlwenVladimir SerbinenkoPublished in: STOC (2015)
Keyphrases
- memory requirements
- memory bandwidth
- wide range
- main memory
- parallel processing
- computational complexity
- decision problems
- graph theory
- level parallelism
- pruning power
- parallel hardware
- memory footprint
- bounded treewidth
- parallel programming
- directed graph
- worst case
- processing elements
- multi threaded
- random access
- graph representation
- parallel implementation
- compute intensive
- graph databases