On the complexity of computing short linearly independent vectors and short bases in a lattice

From MaRDI portal
Revision as of 18:09, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2819600

DOI10.1145/301250.301441zbMath1345.11090OpenAlexW1982051149MaRDI QIDQ2819600

Johannes Blömer, Jean-Pierre Seifert

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301441




Related Items (13)







This page was built for publication: On the complexity of computing short linearly independent vectors and short bases in a lattice