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

Mathematics Subject Classification ID

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

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)