Cyclic self-sumset recognition: a credited corollary of the integer hardness theorem
Kriebel Alec · Zenodo (CERN European Organization for Nuclear Research) · 2026
Credited exposition of the cyclic consequence of the integer hardness theorem of Abboud, Fischer, Safier, and Wallheimer. Ordinary all-pair self-sumset recognition in the same Z/nZ, with unbounded positive input n, is NP-complete separately for binary n with an explicit binary residue list and for an n-bit characteristic vector. Hardness holds already for odd n and nonempty B containing 0 with every canonical 2b