E-LIB Suche - Ergebnisse für: Bennett, Huck

1

Parameterized Inapproximability of the Minimum Distance Pro..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,

Bennett, Huck ; Cheraghchi, Mahdi ; Guruswami, Venkatesan. - p. 553-566 , 2023

Link: https://dl.acm.org/doi/1..

2

The Complexity of the Shortest Vector Problem:

Bennett, Huck
ACM SIGACT News. 54 (2023) 1 - p. 37-61 , 2023

Link: https://doi.org/10.1145/..

3

Lattice Problems beyond Polynomial Time:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,

Aggarwal, Divesh ; Bennett, Huck ; Brakerski, Zvika... - p. 1516-1526 , 2023

Link: https://dl.acm.org/doi/1..

4

Just How Hard Are Rotations of $$\mathbb {Z}^n$$? Algorithm..:

, In: Advances in Cryptology – EUROCRYPT 2023; Lecture Notes in Computer Science,

Bennett, Huck ; Ganju, Atul ; Peetathawatchai, Pura. - p. 252-281 , 2023

Link: https://doi.org/10.1007/..

5

Fine-grained hardness of CVP(P) : everything that we can..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,

Aggarwal, Divesh ; Bennett, Huck ; Golovnev, Alexander. - p. 1816-1835 , 2021

Link: https://dl.acm.org/doi/1..

6

Fine-grained hardness of CVP(P)—Everything that we can prov..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),

Aggarwal, Divesh ; Bennett, Huck ; Golovnev, Alexander. - p. 1816-1835 , 2021

Link: https://doi.org/10.1137/..

7

Hardness of bounded distance decoding on lattices in lp nor..:

, In: Proceedings of the 35th Computational Complexity Conference,

Bennett, Huck ; Peikert, Chris - p. 1-21 , 2020

Link: https://dl.acm.org/doi/1..

8

On percolation and ‐hardness:

Bennett, Huck ; Reichman, Daniel ; Shinkar, Igor
Random Structures & Algorithms. 54 (2018) 2 - p. 228-257 , 2018

Link: https://doi.org/10.1002/..

9

Amortized analysis of smooth quadtrees in all dimensions:

Bennett, Huck ; Yap, Chee
Computational Geometry. 63 (2017) - p. 20-39 , 2017

Link: https://doi.org/10.1016/..

10

Topological $k$-metrics:

Barkan-Vered, Willow ; Bennett, Huck ; Nayyeri, Amir
http://arxiv.org/abs/2308.04609. , 2023

Link: http://arxiv.org/abs/230..

11

Matrix Multiplication Verification Using Coding Theory:

Bennett, Huck ; Gajulapalli, Karthik ; Golovnev, Alexander.
http://arxiv.org/abs/2309.16176. , 2023

Link: http://arxiv.org/abs/230..

12

Parameterized Inapproximability of the Minimum Distance Pro..:

Bennett, Huck ; Cheraghchi, Mahdi ; Guruswami, Venkatesan.
9781450399135. , 2023

Link: http://hdl.handle.net/10..

13

Parameterized Inapproximability of the Minimum Distance Pro..:

Bennett, Huck ; Cheraghchi, Mahdi ; Guruswami, Venkatesan.
http://arxiv.org/abs/2211.07900. , 2022

Link: http://arxiv.org/abs/221..

14

Lattice Problems Beyond Polynomial Time:

Aggarwal, Divesh ; Bennett, Huck ; Brakerski, Zvika...
http://arxiv.org/abs/2211.11693. , 2022

Link: http://arxiv.org/abs/221..

15

Improved Hardness of BDD and SVP Under Gap-(S)ETH:

Bennett, Huck ; Peikert, Chris ; Tang, Yi
doi:10.4230/LIPIcs.ITCS.2022.19. , 2022

Link: https://doi.org/10.4230/..