Some Improved Complexity Results for uSVP and GapSVP
IACR Cryptology ePrint Archive
Abstract & Figures
Sorry, we couldn't extract an abstract for this paper.
Figures and Tables
Sorry, we couldn't extract any figures or tables for this paper.
Sorry, we couldn't extract any citations for this paper.
Sorry, we couldn't extract any references for this paper.
Loading similar papers…
Slides referencing similar topics
Parameterized complexity of some stable matching problems
Ildi Schlotter • Jan 13, 2016
On the Complexity and Decidability of Some Problems Involving Shuffle
Joey Eremondi + 2 • Dec 07, 2015
Graph Drawing Beyond Planarity: Some Results and Open Problems
Giuseppe Liotta • Jul 06, 2015