Non-Boolean OMv: One More Reason to Believe Lower Bounds for Dynamic Problems

Bingbing Hu, Adam Polak

Most of the known tight lower bounds for dynamic problems are based on the Online Boolean Matrix-Vector Multiplication (OMv) Hypothesis, which is not as well studied and understood…