( en | de | ru )

 

Disambiguation of "Bennett, Huck"

Author of the publication

copydeleteadd this publication to your clipboard
Hardness of Bounded Distance Decoding on Lattices in ℓp Norms.

, and . CCC, volume 169 of LIPIcs, page 36:1-36:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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. You can also use the button next to the name to display some publications already assigned to the person.

Loris Bennett

Brandon Bennett

Erin Bennett

James Bennett

Peter Bennett

 

Other publications of authors with the same name

Hardness of Bounded Distance Decoding on Lattices in ℓp Norms., and . CCC, volume 169 of LIPIcs, page 36:1-36:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Just how hard are rotations of ℤn? Algorithms and cryptography with the simplest lattice., , , and . IACR Cryptol. ePrint Arch., (2021)Reconstructing weighted voting schemes from partial information about their power indices., , , and . COLT, volume 134 of Proceedings of Machine Learning Research, page 500-565. PMLR, (2021)Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ℓp Norms., , , and . STOC, page 553-566. ACM, (2023)Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes., and . APPROX/RANDOM, volume 275 of LIPIcs, page 37:1-37:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Amortized Analysis of Smooth Quadtrees in All Dimensions., and . SWAT, volume 8503 of Lecture Notes in Computer Science, page 38-49. Springer, (2014)Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all ℓp Norms., , , and . Electron. Colloquium Comput. Complex., (2022)Lattice Problems beyond Polynomial Time., , , , , , , , and . STOC, page 1516-1526. ACM, (2023)On the Lattice Distortion Problem., , and . ESA, volume 57 of LIPIcs, page 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)., , , and . SODA, page 1816-1835. SIAM, (2021)