Inproceedings,
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem.
B. Barak, S. Hopkins, J. Kelner, P. Kothari, A. Moitra, and A. Potechin.FOCS, page 428-437. IEEE Computer Society, (2016)
Meta data
- BibTeX key
- conf/focs/BarakHKKMP16
- entry type
- inproceedings
- booktitle
- FOCS
- year
- 2016
- pages
- 428-437
- publisher
- IEEE Computer Society
- crossref
- conf/focs/2016
- ee
- http://doi.ieeecomputersociety.org/10.1109/FOCS.2016.53
- isbn
- 978-1-5090-3933-3
- url
- http://dblp.uni-trier.de/db/conf/focs/focs2016.html#BarakHKKMP16
Tags
Users
Comments and Reviewsshow / hide
Cite this publication
More citation styles
- please select -%0 Conference Paper
%1 conf/focs/BarakHKKMP16
%A Barak, Boaz
%A Hopkins, Samuel B.
%A Kelner, Jonathan A.
%A Kothari, Pravesh
%A Moitra, Ankur
%A Potechin, Aaron
%B FOCS
%D 2016
%E Dinur, Irit
%I IEEE Computer Society
%K
%P 428-437
%T A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem.
%U http://dblp.uni-trier.de/db/conf/focs/focs2016.html#BarakHKKMP16
%@ 978-1-5090-3933-3
@inproceedings{conf/focs/BarakHKKMP16,
added-at = {2023-12-12T22:16:04.000+0100},
author = {Barak, Boaz and Hopkins, Samuel B. and Kelner, Jonathan A. and Kothari, Pravesh and Moitra, Ankur and Potechin, Aaron},
biburl = {https://www.bibsonomy.org/bibtex/2267b4c140a2f4380e0e1730618dc9bfb/admin},
booktitle = {FOCS},
crossref = {conf/focs/2016},
editor = {Dinur, Irit},
ee = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2016.53},
interhash = {48a67cb39abceee5c1a5c50cb6399fd8},
intrahash = {267b4c140a2f4380e0e1730618dc9bfb},
isbn = {978-1-5090-3933-3},
keywords = {},
pages = {428-437},
publisher = {IEEE Computer Society},
timestamp = {2023-12-12T22:16:04.000+0100},
title = {A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem.},
url = {http://dblp.uni-trier.de/db/conf/focs/focs2016.html#BarakHKKMP16},
year = 2016
}