Login / Signup
Automated Lower Bounds on the I/O Complexity of Computation Graphs.
Saachi Jain
Matei Zaharia
Published in:
CoRR (2019)
Keyphrases
</>
lower bound
upper bound
worst case
input output
average case complexity
subgraph isomorphism
storage cost
computational complexity
graph mining
decision problems
np hard
objective function
memory requirements
directed graph
space complexity
graph theoretic
semi automated
lower bounding