research
∙
08/08/2023
Topological k-metrics
Metric spaces (X, d) are ubiquitous objects in mathematics and computer ...
share
research
∙
11/21/2022
Lattice Problems Beyond Polynomial Time
We study the complexity of lattice problems in a world where algorithms,...
research
∙
11/15/2022
Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all ℓ_p Norms
We prove that the Minimum Distance Problem (MDP) on linear codes over an...
research
∙
02/15/2022
Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes
We give a simple proof that the (approximate, decisional) Shortest Vecto...
research
∙
09/09/2021
Improved Hardness of BDD and SVP Under Gap-(S)ETH
We show improved fine-grained hardness of two key lattice problems in th...
research
∙
07/19/2020
Reconstructing weighted voting schemes from partial information about their power indices
A number of recent works [Goldberg 2006; O'Donnell and Servedio 2011; De...
research
∙
03/17/2020
Hardness of Bounded Distance Decoding on Lattices in ℓ_p Norms
Bounded Distance Decoding _p,α is the problem of decoding a lattice when...
research
∙
11/06/2019