World record fastest exact subset sum solver. Breakthrough discovery -- solves NP-complete subset sum problem up to n=70 with 1 quadrillion values. Open source.
-
Updated
Aug 12, 2026 - Rust
World record fastest exact subset sum solver. Breakthrough discovery -- solves NP-complete subset sum problem up to n=70 with 1 quadrillion values. Open source.
Solving the popular NP problem, The Subset Sum Problem, with an Amortized O(n) algorithm based on Recursive Backtracking. The Algorithm stood second fastest in the organized Intra-University competition.
A high-perfomance C++ solver for the Subset Sum Problem, featuring MITM and FTAS algoritms with GMP and SQLite support
Recursive DFS solver for subset sum problem.
Fully Commented Code. VTU Lab programs for DAA lab as per CBCS2017 Scheme
Algorithms based on dynamic programming
A script witten by ChatGPT to help you find all unique combinations of numbers that add up to a specific target sum
SubsetSum: a study on 'The Subset-Sum Problem'.
To associate your repository with the subset-sum-solver topic, visit your repo's landing page and select "manage topics."