Follow
Huck Bennett
Title
Cited by
Cited by
Year
On the quantitative hardness of CVP
H Bennett, A Golovnev, N Stephens-Davidowitz
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 13-24, 2017
412017
Fine-grained hardness of CVP (P)—Everything that we can prove (and nothing else)
D Aggarwal, H Bennett, A Golovnev, N Stephens-Davidowitz
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
292021
Planar minimization diagrams via subdivision with applications to anisotropic Voronoi diagrams
H Bennett, E Papadopoulou, C Yap
Computer Graphics Forum 35 (5), 229-247, 2016
212016
Just How Hard Are Rotations of ? Algorithms and Cryptography with the Simplest Lattice
H Bennett, A Ganju, P Peetathawatchai, N Stephens-Davidowitz
Annual International Conference on the Theory and Applications of …, 2023
182023
Amortized analysis of smooth quadtrees in all dimensions
H Bennett, C Yap
Computational Geometry 63, 20-39, 2017
132017
Hardness of the (approximate) shortest vector problem: A simple proof via reed-solomon codes
H Bennett, C Peikert
arXiv preprint arXiv:2202.07736, 2022
92022
Improved hardness of BDD and SVP under Gap-(S) ETH
H Bennett, C Peikert, Y Tang
arXiv preprint arXiv:2109.04025, 2021
92021
Hardness of Bounded Distance Decoding on Lattices in Norms
H Bennett, C Peikert
arXiv preprint arXiv:2003.07903, 2020
92020
Lattice problems beyond polynomial time
D Aggarwal, H Bennett, Z Brakerski, A Golovnev, R Kumar, Z Li, S Peters, ...
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1516-1526, 2023
72023
Model counting using the inclusion-exclusion principle
H Bennett, S Sankaranarayanan
International Conference on Theory and Applications of Satisfiability …, 2011
6*2011
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
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 553-566, 2023
52023
The complexity of the shortest vector problem
H Bennett
ACM SIGACT News 54 (1), 37-61, 2023
52023
On percolation and NP‐hardness
H Bennett, D Reichman, I Shinkar
Random Structures & Algorithms 54 (2), 228-257, 2019
52019
Solving Random Low-Density Subset Sum Using Babai’s Algorithm
H Bennett
22022
On the lattice distortion problem
H Bennett, D Dadush, N Stephens-Davidowitz
arXiv preprint arXiv:1605.03613, 2016
22016
Topological k-Metrics
W Barkan, H Bennett, A Nayyeri
40th International Symposium on Computational Geometry (SoCG 2024), 2024
2024
Relating Code Equivalence to Other Isomorphism Problems
H Bennett, KMH Win
Cryptology ePrint Archive, 2024
2024
Matrix Multiplication Verification Using Coding Theory
H Bennett, K Gajulapalli, A Golovnev, PG Warton
arXiv preprint arXiv:2309.16176, 2023
2023
Topological -metrics
W Barkan-Vered, H Bennett, A Nayyeri
arXiv preprint arXiv:2308.04609, 2023
2023
Lattice Algorithms for Integer Programming
H Bennett
2022
The system can't perform the operation now. Try again later.
Articles 1–20