no code implementations • 18 Feb 2022 • Bojun Lu, Duan Li, Rujun Jiang
Subset-sum problems belong to the NP class and play an important role in both complexity theory and knapsack-based cryptosystems, which have been proved in the literature to become hardest when the so-called density approaches one.
