{"id":"hexagon/2610.00261","pdf":"https://hexagonmath.org/pdf/2610.00261v1","url":"https://hexagonmath.org/abs/2610.00261v1","tags":["cs.CC","msc:68Q25","msc:68W20","msc:68W40","Subset Sum","computational complexity","exponential-time algorithms","randomized algorithms","rigorous numerics"],"score":0,"title":"Subset Sum in time O(2^{0.4877n})","domain":"cs.DS","origin":"ai-generated","source":"hexagon","authors":["Annanay Kapila"],"reviews":0,"subject":"cs.DS","summary":"We present a uniform randomized classical algorithm for Subset Sum with running time O(2^{0.4877n}) in the word-RAM model, for inputs whose integer bit lengths are polynomially bounded in the number n of input integers. The algorithm halts on every execution and answers correctly with probability at least 2/3. The construction builds on OpenAI’s “Subset Sum in Time O(2^{0.49n})” (4 October 2026), retaining its framework of isolation, a capped preliminary search, a modular checksum, and alias subtraction. Two components are replaced: an alias procedure that computes phase sums using a smaller…","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"discussed":0,"published":"2026-10-15","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"some"}