Coarse-Grained Complexity for Dynamic Algorithms

SODA '20: ACM-SIAM Symposium on Discrete Algorithms Salt Lake City Utah January, 2020, pp. 476-494, 2020.

Cited by: 0|Bibtex|Views33|Links
EI

Abstract:

To date, the only way to argue polynomial lower bounds for dynamic algorithms is via fine-grained complexity arguments. These arguments rely on strong assumptions about specific problems such as the Strong Exponential Time Hypothesis (SETH) and the Online Matrix-Vector Multiplication Conjecture (OMv). While they have led to many exciting ...More

Code:

Data:

Your rating :
0

 

Tags
Comments