[{"file_date_updated":"2018-06-05T08:28:14Z","publication":"Proceedings of the thirty-first annual ACM symposium on Theory of computing  - STOC '99","citation":{"ama":"Blömer J, Seifert J-P. On the complexity of computing short linearly independent vectors and short bases in a lattice. In: <i>Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99</i>. ACM Press; 1999. doi:<a href=\"https://doi.org/10.1145/301250.301441\">10.1145/301250.301441</a>","bibtex":"@inproceedings{Blömer_Seifert_1999, title={On the complexity of computing short linearly independent vectors and short bases in a lattice}, DOI={<a href=\"https://doi.org/10.1145/301250.301441\">10.1145/301250.301441</a>}, booktitle={Proceedings of the thirty-first annual ACM symposium on Theory of computing  - STOC ’99}, publisher={ACM Press}, author={Blömer, Johannes and Seifert, Jean-Pierre}, year={1999} }","mla":"Blömer, Johannes, and Jean-Pierre Seifert. “On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice.” <i>Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99</i>, ACM Press, 1999, doi:<a href=\"https://doi.org/10.1145/301250.301441\">10.1145/301250.301441</a>.","short":"J. Blömer, J.-P. Seifert, in: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99, ACM Press, 1999.","chicago":"Blömer, Johannes, and Jean-Pierre Seifert. “On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice.” In <i>Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99</i>. ACM Press, 1999. <a href=\"https://doi.org/10.1145/301250.301441\">https://doi.org/10.1145/301250.301441</a>.","apa":"Blömer, J., &#38; Seifert, J.-P. (1999). On the complexity of computing short linearly independent vectors and short bases in a lattice. <i>Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99</i>. <a href=\"https://doi.org/10.1145/301250.301441\">https://doi.org/10.1145/301250.301441</a>","ieee":"J. Blömer and J.-P. Seifert, “On the complexity of computing short linearly independent vectors and short bases in a lattice,” 1999, doi: <a href=\"https://doi.org/10.1145/301250.301441\">10.1145/301250.301441</a>."},"file":[{"creator":"feidens","date_created":"2018-06-05T08:28:14Z","relation":"main_file","date_updated":"2018-06-05T08:28:14Z","file_name":"short.pdf","access_level":"closed","file_size":313561,"file_id":"3025","content_type":"application/pdf","success":1}],"date_created":"2018-06-05T08:27:53Z","type":"conference","department":[{"_id":"64"}],"title":"On the complexity of computing short linearly independent vectors and short bases in a lattice","year":"1999","status":"public","author":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"},{"first_name":"Jean-Pierre","last_name":"Seifert","full_name":"Seifert, Jean-Pierre"}],"publication_identifier":{"isbn":["1581130678"]},"publication_status":"published","date_updated":"2023-01-10T13:49:15Z","has_accepted_license":"1","publisher":"ACM Press","_id":"3024","user_id":"23","ddc":["000"],"doi":"10.1145/301250.301441"}]