Recognizing sumsets is NP-complete

DOI10.1137/1.9781611978322.153MaRDI QIDQ7289734zbMATH OpenFDO

Authors Amir Abboud, Nick Fischer, Ron Safier, Nathan Wallheimer

Publication date 3 July 2026

Full work available at URL https://doi.org/10.1137/1.9781611978322.153

Mathematics Subject Classification ID

No records found.

Cited in

(2)

• Testing sumsets is hard
• (Multivariate) k-SUM as barrier to succinct computation

This page was built for publication: Recognizing sumsets is NP-complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289734)