[{"_id":"3024","department":[{"_id":"64"}],"date_updated":"2019-01-03T13:13:58Z","publication_identifier":{"isbn":["1581130678"]},"status":"public","title":"On the complexity of computing short linearly independent vectors and short bases in a lattice","accept":"1","date_created":"2018-06-05T08:27:53Z","file":[{"open_access":1,"access_level":"closed","date_updated":"2018-06-05T08:28:14Z","content_type":"application/pdf","file_size":313561,"file_id":"3025","success":1,"relation":"main_file","file_name":"short.pdf","date_created":"2018-06-05T08:28:14Z","creator":"feidens"}],"type":"conference","publisher":"ACM Press","user_id":"25078","author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"first_name":"Jean-Pierre","full_name":"Seifert, Jean-Pierre","last_name":"Seifert"}],"ddc":["000"],"publication_status":"published","publication":"Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99","doi":"10.1145/301250.301441","file_date_updated":"2018-06-05T08:28:14Z","year":"1999","citation":{"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} }","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.","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","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.","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.","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."}}]