Popular conjectures as a barrier for dynamic planar graph algorithms

DOI10.1109/FOCS.2016.58MaRDI QIDQ6946450zbMATH OpenFDO

Authors Søren Dahlgaard, Amir Abboud

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2016.58

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(5)

• The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds
• Conditional lower bounds for dynamic geometric measure problems
• Fine-grained complexity lower bounds for families of dynamic graphs
• Conditional lower bounds for dynamic geometric measure problems
• Dynamic matching with better-than-2 approximation in polylogarithmic update time

This page was built for publication: Popular conjectures as a barrier for dynamic planar graph algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946450)