Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs.

Monika Henzinger Ami Paz A. R. Sricharan

Published in: CoRR (2022)

Keyphrases

fine grained
lower bound
coarse grained
worst case
access control
tightly coupled
massively parallel
branch and bound algorithm
data lineage
optimal solution
upper bound
np complete
space complexity
privacy preserving
information retrieval
data model
objective function