Theoretical computer science · Oct 6, 2026
Subset Sum in time
Gives a uniform randomized classical algorithm for worst-case Subset Sum in ordinary word-RAM time on polynomial-bit inputs, where n counts the integers. The time bound holds on every execution and success probability is at least 2/3 on every input. Inputs may repeat positive integers; words have bits for maximum input bit length b.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model