All non-trivial variants of 3-LDT are equivalent

DOI10.1145/3357713.3384275OpenAlexW3035477538MaRDI QIDQ5144982

Tatiana Starikovskaya, Bartłomiej Dudek, Paweł Gawrychowski

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.01289

zbMATH Keywords

fine-grained complexity3-SUM3-LDT

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Geometric pattern matching reduces to \(k\)-SUM

This page was built for publication: All non-trivial variants of 3-LDT are equivalent