@InProceedings{bandeira_et_al:LIPIcs.ITCS.2020.78,
  author =	{Bandeira, Afonso S. and Kunisky, Dmitriy and Wein, Alexander S.},
  title =	{{Computational Hardness of Certifying Bounds on Constrained PCA Problems}},
  booktitle =	{11th Innovations in Theoretical Computer Science Conference (ITCS 2020)},
  pages =	{78:1--78:29},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-134-4},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{151},
  editor =	{Vidick, Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.78},
  URN =		{urn:nbn:de:0030-drops-117633},
  doi =		{10.4230/LIPIcs.ITCS.2020.78},
  annote =	{Keywords: Certification, Sherrington-Kirkpatrick model, spiked Wishart model, low-degree likelihood ratio}
}