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.

Abstract: Subset selection has been widely studied but remains underexplored for synthetic tabular data, particularly in data sharing contexts that require high quality data. While generative models ...

What Is This Subset Sum Solver? This is the world record exact subset sum solver. It holds world records across all 65 tested algorithm categories, solving the NP-complete subset sum problem from 10 ...

Abstract: Genetic algorithm (GA) has been extensively used for solving complex problems. Due to a high computational burden of finding solutions using GA, acceleration with hardware support has been a ...