@InProceedings{banks_et_al:LIPIcs.APPROX-RANDOM.2017.28,
  author =	{Banks, Jess and Kleinberg, Robert and Moore, Cristopher},
  title =	{{The Lov\'{a}sz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)},
  pages =	{28:1--28:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-044-6},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{81},
  editor =	{Jansen, Klaus and Rolim, Jos\'{e} D. P. and Williamson, David P. and Vempala, Santosh S.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2017.28},
  URN =		{urn:nbn:de:0030-drops-75771},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2017.28},
  annote =	{Keywords: Lov\'{a}sz Theta Function, Random Regular Graphs, Sum of Squares, Orthogonal Polynomials}
}