A new approach to the planted clique problem
By Alan M. Frieze, R. Kannan. 2008
51 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Vitaly Feldman
- Elena Grigorescu
- Yann LeCun
- Santosh Srinivas Vempala
- Lev Reyzin
- Gregory Valiant
- Levent Sagun
- Ying Xiao
In Computer Graphics and Computer-Aided Design
- Yann LeCun
- Santosh Srinivas Vempala
- Blaine Nelson
- L. Lov'asz
- H. Brendan McMahan
- Abraham D. Flaxman
- Adam Tauman Kalai
Citations in the corpus
- Learning Discrete Distributions from Untrusted Batches (2017, background): “erent” factors (see e.g. [Kru77, MSS16]). Still, for many tensor decomposition problems over various families of random nearly low-rank tensors—such as those obtained from instances of planted-clique [FK08]—these decomposition problems remain mysterious. 1.3 Future directions and discussion Two conc”
- Statistical algorithms and a lower bound for detecting planted cliques (2012, background): “One interesting approach for finding the planted clique was proposed by Frieze and Kannan [2008].”
- Explorations on high dimensional landscapes (2014, background): “From an optimization point of view a similar consideration can be found in Frieze & Kannan (2008).”