From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes.

H. Bennett, и C. Peikert. APPROX/RANDOM, том 275 из LIPIcs, стр. 37:1-37:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Loris Bennett

Brandon Bennett

Erin Bennett

James Bennett

Peter Bennett

Другие публикации лиц с тем же именем

Hardness of Bounded Distance Decoding on Lattices in ℓp Norms.H. Bennett, и C. Peikert. CCC, том 169 из LIPIcs, стр. 36:1-36:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Amortized Analysis of Smooth Quadtrees in All Dimensions.H. Bennett, и C. Yap. SWAT, том 8503 из Lecture Notes in Computer Science, стр. 38-49. Springer, (2014)Just how hard are rotations of ℤn? Algorithms and cryptography with the simplest lattice.H. Bennett, A. Ganju, P. Peetathawatchai, и N. Stephens-Davidowitz. IACR Cryptol. ePrint Arch., (2021)Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ℓp Norms.H. Bennett, M. Cheraghchi, V. Guruswami, и J. Ribeiro. STOC, стр. 553-566. ACM, (2023)Reconstructing weighted voting schemes from partial information about their power indices.H. Bennett, A. De, R. Servedio, и E. Vlatakis-Gkaragkounis. COLT, том 134 из Proceedings of Machine Learning Research, стр. 500-565. PMLR, (2021)Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes.H. Bennett, и C. Peikert. APPROX/RANDOM, том 275 из LIPIcs, стр. 37:1-37:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all ℓp Norms.H. Bennett, M. Cheraghchi, V. Guruswami, и J. Ribeiro. Electron. Colloquium Comput. Complex., (2022)Lattice Problems beyond Polynomial Time.D. Aggarwal, H. Bennett, Z. Brakerski, A. Golovnev, R. Kumar, Z. Li, S. Peters, N. Stephens-Davidowitz, и V. Vaikuntanathan. STOC, стр. 1516-1526. ACM, (2023)On the Lattice Distortion Problem.H. Bennett, D. Dadush, и N. Stephens-Davidowitz. ESA, том 57 из LIPIcs, стр. 9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else).D. Aggarwal, H. Bennett, A. Golovnev, и N. Stephens-Davidowitz. SODA, стр. 1816-1835. SIAM, (2021)

BibSonomy

Disambiguation