2 papers
cs.CC2025
Certificate-Sensitive Subset Sum: Realizing Instance Complexity
Jesus Salas
The Subset Sum problem is a classical NP-complete problem with a long-standing deterministic bound due to Horowitz and Sahni. We present results at two distinct leve…
cs.DS2025
Beyond Worst-Case Subset Sum: An Adaptive, Structure-Aware Solver with Sub- Enumeration
Jesus Salas
The Subset Sum problem, which asks whether a set of integers has a subset summing to a target , is a fundamental NP-complete problem in cryptography and combinatorial optimi…