Truly Subquadratic 3SUM over Every Bounded-Exponent Abelian GroupResearch Paper
Three-list 3SUM asks whether for some in three given lists. It is a central problem of fine-grained complexity, and truly subquadratic algorithms for it over the integers have recently been obtained through the thin-matrix-product algorithm of Alman and Vassilevska Williams (arXiv:2610.06783v1); another route is due to Chan, Itakura, Ma…