BibTeX record conf/focs/AroraBSS93

download as .bib file

@inproceedings{DBLP:conf/focs/AroraBSS93,
  author       = {Sanjeev Arora and
                  L{\'{a}}szl{\'{o}} Babai and
                  Jacques Stern and
                  Z. Sweedyk},
  title        = {The Hardness of Approximate Optimia in Lattices, Codes, and Systems
                  of Linear Equations},
  booktitle    = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
                  California, USA, 3-5 November 1993},
  pages        = {724--733},
  publisher    = {{IEEE} Computer Society},
  year         = {1993},
  url          = {https://doi.org/10.1109/SFCS.1993.366815},
  doi          = {10.1109/SFCS.1993.366815},
  timestamp    = {Thu, 23 Mar 2023 23:57:51 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/AroraBSS93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.