On the Hardness of Average-Case k-SUM

Zvika Brakerski, Noah Stephens-Davidowitz, Vinod Vaikuntanathan. On the Hardness of Average-Case k-SUM. In Mary Wootters, Laura Sanità, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference). Volume 207 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

Authors

Zvika Brakerski

This author has not been identified. Look up 'Zvika Brakerski' in Google

Noah Stephens-Davidowitz

This author has not been identified. Look up 'Noah Stephens-Davidowitz' in Google

Vinod Vaikuntanathan

This author has not been identified. Look up 'Vinod Vaikuntanathan' in Google