@inproceedings{DBLP:conf/focs/BarakHKKMP16,
  author       = {Boaz Barak and
                  Samuel B. Hopkins and
                  Jonathan A. Kelner and
                  Pravesh Kothari and
                  Ankur Moitra and
                  Aaron Potechin},
  editor       = {Irit Dinur},
  title        = {A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem},
  booktitle    = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
                  2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
                  {USA}},
  pages        = {428--437},
  publisher    = {{IEEE} Computer Society},
  year         = {2016},
  url          = {https://doi.org/10.1109/FOCS.2016.53},
  doi          = {10.1109/FOCS.2016.53},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BarakHKKMP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"87zRpR63b3Mx9Ff7y","bibbaseid":"barak-hopkins-kelner-kothari-moitra-potechin-anearlytightsumofsquareslowerboundfortheplantedcliqueproblem-2016","author_short":["Barak, B.","Hopkins, S. B.","Kelner, J. A.","Kothari, P.","Moitra, A.","Potechin, A."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Boaz"],"propositions":[],"lastnames":["Barak"],"suffixes":[]},{"firstnames":["Samuel","B."],"propositions":[],"lastnames":["Hopkins"],"suffixes":[]},{"firstnames":["Jonathan","A."],"propositions":[],"lastnames":["Kelner"],"suffixes":[]},{"firstnames":["Pravesh"],"propositions":[],"lastnames":["Kothari"],"suffixes":[]},{"firstnames":["Ankur"],"propositions":[],"lastnames":["Moitra"],"suffixes":[]},{"firstnames":["Aaron"],"propositions":[],"lastnames":["Potechin"],"suffixes":[]}],"editor":[{"firstnames":["Irit"],"propositions":[],"lastnames":["Dinur"],"suffixes":[]}],"title":"A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem","booktitle":"IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA","pages":"428–437","publisher":"IEEE Computer Society","year":"2016","url":"https://doi.org/10.1109/FOCS.2016.53","doi":"10.1109/FOCS.2016.53","timestamp":"Thu, 23 Mar 2023 00:00:00 +0100","biburl":"https://dblp.org/rec/conf/focs/BarakHKKMP16.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/focs/BarakHKKMP16,\n author = {Boaz Barak and\n Samuel B. Hopkins and\n Jonathan A. Kelner and\n Pravesh Kothari and\n Ankur Moitra and\n Aaron Potechin},\n editor = {Irit Dinur},\n title = {A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem},\n booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}\n 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,\n {USA}},\n pages = {428--437},\n publisher = {{IEEE} Computer Society},\n year = {2016},\n url = {https://doi.org/10.1109/FOCS.2016.53},\n doi = {10.1109/FOCS.2016.53},\n timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},\n biburl = {https://dblp.org/rec/conf/focs/BarakHKKMP16.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Barak, B.","Hopkins, S. B.","Kelner, J. A.","Kothari, P.","Moitra, A.","Potechin, A."],"editor_short":["Dinur, I."],"key":"DBLP:conf/focs/BarakHKKMP16","id":"DBLP:conf/focs/BarakHKKMP16","bibbaseid":"barak-hopkins-kelner-kothari-moitra-potechin-anearlytightsumofsquareslowerboundfortheplantedcliqueproblem-2016","role":"author","urls":{"Paper":"https://doi.org/10.1109/FOCS.2016.53"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/b/BBarak.bib","dataSources":["sNDcqxpX5cBQ5Pu7G","763eChmCTEH5onHpy"],"keywords":[],"search_terms":["nearly","tight","sum","squares","lower","bound","planted","clique","problem","barak","hopkins","kelner","kothari","moitra","potechin"],"title":"A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem","year":2016}