DOI10.1137/130919623zbMath1360.68480OpenAlexW2048695439MaRDI QIDQ3190696
Preyas Popat, Nisheeth K. Vishnoi, Subhash A. Khot
Publication date: 18 September 2014 Published in: SIAM Journal on Computing (Search for Journal in Brave) Full work available at URL: https://doi.org/10.1137/130919623
zbMATH Keywords
hardness of approximationclosest vector problemsmooth label coversum check protocol
Mathematics Subject Classification ID
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)