Metraipolis › archive › dc_a77fba2121ab

Subset Sum via Partial Match — arXiv:2610.10446

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

How to cite

Subset Sum via Partial Match — arXiv:2610.10446 — arXiv (en), https://arxiv.org/abs/2610.10446 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a77fba2121ab (Metraipolis archive dc_a77fba2121ab, sha256 fdc49015e13b678ed966c76fed10e5ea44f12d79d8f159ce70f73cf8fc60e98a)
BibTeX
@misc{dca77fba2121ab,
  title = {Subset Sum via Partial Match — arXiv:2610.10446},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.10446},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a77fba2121ab; sha256 fdc49015e13b678ed966c76fed10e5ea44f12d79d8f159ce70f73cf8fc60e98a},
  year = {2026}
}

Archived text

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

We show that the subset sum problem can be solved in time $O(2^{0.499999n})$, breaking the $2^{n/2}$ meet-in-the-middle barrier. Our approach builds on the representation technique framework of Randolph and Węgrzycki (STOC 2026). We choose a representation for which testing the compatibility of pairs of partial solution vectors is exactly the partial match problem. To beat exponent $1/2$ for subset sum, it then suffices to give a nontrivial partial match algorithm in a certain parameter regime. We achieve this by designing a depth-2 linear circuit for the partial match matrix, which yields an efficient algorithm via the framework of Alman and Li (FOCS 2025).

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Computational Complexity (cs.CC).
Pagina del lavoro: https://arxiv.org/abs/2610.10446 — 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.210Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).