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 ...

Abstract: In order to improve the performance and reliability of Low-Density Parity-Check (LDPC) code decoding algorithms, this paper proposes a Self-Correcting Minimum Sum algorithm with Dual ...