The Planted $k$-SUM Problem: Algorithms, Lower Bounds, Hardness Amplification, and Cryptography - researchr publication

researchr

You are not signed in
Sign in
Sign up

Sagnik Saha, Nikolaj I. Schwartzbach, Prashant Nalini Vasudevan. The Planted $k$-SUM Problem: Algorithms, Lower Bounds, Hardness Amplification, and Cryptography. Electronic Colloquium on Computational Complexity (ECCC), TR23, 2023. [doi]

Abstract is missing.

runs on WebDSL