The Planted k-SUM Problem: Algorithms, Lower Bounds, Hardness Amplification, and Cryptography.
Sagnik SahaNikolaj I. SchwartzbachPrashant Nalini VasudevanPublished in: CoRR (2023)
Keyphrases
- lower bound
- objective function
- online algorithms
- worst case
- computational complexity
- machine learning algorithms
- significant improvement
- learning algorithm
- orders of magnitude
- upper and lower bounds
- network flow
- running times
- computational cost
- upper bound
- benchmark datasets
- branch and bound
- lower and upper bounds
- data structure