scientific article; zbMATH DE number 7768374

DOI10.4230/LIPICS.APPROX/RANDOM.2021.29arXiv2010.08821MaRDI QIDQ6090904FDOQ6090904

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

Publication date: 20 November 2023

Full work available at URL: https://arxiv.org/abs/2010.08821

Title of this publication is not available (Why is that?)

zbMATH Keywords

average-case hardnessfine-grained complexity\(k\)-SUM

Mathematics Subject Classification ID

Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cited In (3)

• Average-case lower bounds for the plurality problem
• On the hardness of finding subsets with equal average
• Lattice problems beyond polynomial time

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090904)