Huck Bennett

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

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 SIAM Journal on Computing	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
scientific article; zbMATH DE number 7788447 (Why is no real title available?) (available as arXiv preprint)	2024-01-15	Paper
Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice Advances in Cryptology – EUROCRYPT 2023	2023-12-08	Paper
Hardness of bounded distance decoding on lattices in lp norms (available as arXiv preprint)	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 Random Structures & Algorithms	2019-05-02	Paper
Amortized analysis of smooth quadtrees in all dimensions Computational Geometry	2018-11-01	Paper
On the lattice distortion problem (available as arXiv preprint)	2018-03-02	Paper
On percolation and NP-hardness	2017-12-19	Paper
Amortized Analysis of Smooth Quadtrees in All Dimensions Algorithm Theory – SWAT 2014	2014-09-02	Paper

Research outcomes over time

This page was built for person: Huck Bennett