( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Lattice Distortion Problem.

, , и . ESA, том 57 из LIPIcs, стр. 9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Hans Noah

Owen Stephens

Elizabeth Stephens

Frauke Christine Noah

Ernst Magnus Noah

 

Другие публикации лиц с тем же именем

On the Lattice Distortion Problem., , и . ESA, том 57 из LIPIcs, стр. 9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the Hardness of Average-case k-SUM., , и . CoRR, (2020)The more the merrier! On the complexity of finding multicollisions, with connections to codes and lattices., , и . Electron. Colloquium Comput. Complex., (2024)On the Gaussian Measure Over Lattices.. New York University, USA, (2017)Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else)., , , и . SODA, стр. 1816-1835. SIAM, (2021)(Gap/S)ETH Hardness of SVP., и . CoRR, (2017)Extractor Lower Bounds, Revisited., , , , и . APPROX-RANDOM, том 176 из LIPIcs, стр. 1:1-1:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Slide Reduction, Revisited - Filling the Gaps in SVP Approximation., , , и . CRYPTO (2), том 12171 из Lecture Notes in Computer Science, стр. 274-295. Springer, (2020)A 2n/2-Time Algorithm for √n-SVP and √n-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP., , и . CoRR, (2020)On the (im)possibility of branch-and-bound search-to-decision reductions for approximate optimization., , , и . Electron. Colloquium Comput. Complex., (2021)