BibTeX record conf/stoc/BrakerskiLPRS13

download as .bib file

@inproceedings{DBLP:conf/stoc/BrakerskiLPRS13,
  author       = {Zvika Brakerski and
                  Adeline Langlois and
                  Chris Peikert and
                  Oded Regev and
                  Damien Stehl{\'{e}}},
  editor       = {Dan Boneh and
                  Tim Roughgarden and
                  Joan Feigenbaum},
  title        = {Classical hardness of learning with errors},
  booktitle    = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
                  USA, June 1-4, 2013},
  pages        = {575--584},
  publisher    = {{ACM}},
  year         = {2013},
  url          = {https://doi.org/10.1145/2488608.2488680},
  doi          = {10.1145/2488608.2488680},
  timestamp    = {Sat, 19 Oct 2019 19:58:29 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/BrakerskiLPRS13.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.