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.
no code implementations • 28 Jan 2021 • Alex L. Wang, Rujun Jiang
Specifically, we say that a set of quadratic forms is almost SDC (ASDC) if it is the limit of SDC sets and d-restricted SDC (d-RSDC) if it is the restriction of an SDC set in up to d-many additional dimensions.
Optimization and Control
