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