Metraipolis › archive › dc_b95dd0924f7a

3SUM Is Really Hard: A Real-to-Integer Reduction — arXiv:2610.10153

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.10153
License (as archived)
CC0-1.0
Archived
2026-10-08T12:49:45.673Z
SHA-256 of the archived text
12059faf17d79312ffdc6bdb52d40f86657bc8d2dde6ffb7d2244c880d841db6
Stable URL of this page
https://metraipolis.com/documento/dc_b95dd0924f7a

How to cite

3SUM Is Really Hard: A Real-to-Integer Reduction — arXiv:2610.10153 — arXiv (en), https://arxiv.org/abs/2610.10153 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b95dd0924f7a (Metraipolis archive dc_b95dd0924f7a, sha256 12059faf17d79312ffdc6bdb52d40f86657bc8d2dde6ffb7d2244c880d841db6)
BibTeX
@misc{dcb95dd0924f7a,
  title = {3SUM Is Really Hard: A Real-to-Integer Reduction — arXiv:2610.10153},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.10153},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b95dd0924f7a; sha256 12059faf17d79312ffdc6bdb52d40f86657bc8d2dde6ffb7d2244c880d841db6},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10153. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We show that if the 3SUM problem on integer-valued inputs can be solved in truly subquadratic time, then it can also be solved in truly subquadratic time on real-valued inputs. This answers an open problem posed by Chan, Vassilevska Williams, and Xu [STOC 2022], and constitutes the first such tight real-to-integer self-reduction in fine-grained complexity. Our proof relies on a surprising combination of the Frank--Tardos theorem from optimization with Freiman-type theorems from additive combinatorics.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2610.10153 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T12:19:30.206Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).