research
∙
11/21/2022
Lattice Problems Beyond Polynomial Time
We study the complexity of lattice problems in a world where algorithms,...
share
research
∙
11/08/2022
Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms, and of the Subset Sum Problem!
Recent work [BGS17,ABGS19] has shown SETH hardness of some constant fact...
research
∙
04/22/2022
3D pride without 2D prejudice: Bias-controlled multi-level generative models for structure-based ligand design
Generative models for structure-based molecular design hold significant ...
research
∙
04/14/2021
Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms
We show a number of reductions between the Shortest Vector Problem and t...
research
∙
06/24/2020
Hardness of Approximation of (Multi-)LCS over Small Alphabet
The problem of finding longest common subsequence (LCS) is one of the fu...
research
∙
02/19/2020
Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding
The most important computational problem on lattices is the Shortest Vec...
research
∙
11/07/2018
