Login / Signup
The Planted $k$-SUM Problem: Algorithms, Lower Bounds, Hardness Amplification, and Cryptography.
Sagnik Saha
Nikolaj I. Schwartzbach
Prashant Nalini Vasudevan
Published in:
Electron. Colloquium Comput. Complex. (2023)
Keyphrases
</>
lower bound
worst case
computational complexity
objective function
data structure
computational cost
upper bound
computationally efficient
upper and lower bounds
online algorithms
learning algorithm
special case
benchmark datasets
error bounds
learning theory