Fine-grained complexity of analyzing compressed data: quantifying improvements over decompress-and-solve

DOI10.1109/FOCS.2017.26MaRDI QIDQ6946362zbMATH OpenFDO

Authors Amir Abboud, Karl Bringmann, Marvin Künnemann, Artūrs Bačkurs

Publication date 6 August 2025

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

Mathematics Subject Classification ID

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

Cited in

(7)

• The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds
• Translating Hausdorff is hard: fine-grained lower bounds for Hausdorff distance under translation
• Fine-grained hardness for edit distance to a fixed sequence
• Exploring the approximability landscape of 3SUM
• Faster combinatorial k-clique algorithms
• Work-efficient query evaluation in constant time with PRAMs
• (Multivariate) k-SUM as barrier to succinct computation

This page was built for publication: Fine-grained complexity of analyzing compressed data: quantifying improvements over decompress-and-solve

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