On the Hardness of Average-Case k-SUM

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Zvika Brakerski, Noah Stephens-Davidowitz, Vinod Vaikuntanathan

Journal title: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2021, August 16-18, 2021, University of Washington, Seattle, Washington, {USA} (Virtual Conference)

Journal publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"

Published year: 2021

DOI identifier: 10.4230/lipics.approx/random.2021.29