"A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem."

Boaz Barak et al. (2019)

> Home

Details and statistics

DOI: 10.1137/17M1138236

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/BarakHKKMP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/BarakHKKMP19
Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh K. Kothari, Ankur Moitra, Aaron Potechin:
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. SIAM J. Comput. 48(2): 687-735 (2019)

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.