Huck Bennett

Available identifiers

Publication	Date of Publication	Type
Hardness of the (approximate) shortest vector problem: a simple proof via Reed-Solomon codes	2025-01-14	Paper
Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_{p}\) norms	2024-10-21	Paper
Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_p\) norms	2024-05-08	Paper
Lattice problems beyond polynomial time	2024-05-08	Paper
https://portal.mardi4nfdi.de/entity/Q6147364	2024-01-15	Paper
Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice	2023-12-08	Paper
Hardness of bounded distance decoding on lattices in lp norms	2022-07-21	Paper
Reconstructing weighted voting schemes from partial information about their power indices	2020-07-19	Paper
On percolation and \(\mathcal{NP}\)-hardness	2019-05-02	Paper
Amortized analysis of smooth quadtrees in all dimensions	2018-11-01	Paper
On the lattice distortion problem	2018-03-02	Paper
On percolation and NP-hardness	2017-12-19	Paper
Amortized Analysis of Smooth Quadtrees in All Dimensions	2014-09-02	Paper

This page was built for person: Huck Bennett