In computational complexity theory, a planted clique or hidden clique in an undirected graph is a clique formed from another graph by selecting aâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Jacob Steinhardt
- Electronic Colloquium on Computational Complexity
- 2017

We consider a robust analog of the planted clique problem. In this analog, a set S of vertices is chosen and all edges in S areâ€¦Â (More)

Is this relevant?

2015

2015

- Prasad Raghavendra, Tselil Schramm
- ArXiv
- 2015

We give a lower bound of Î©Ìƒ( âˆš n) for the degree-4 Sum-of-Squares SDP relaxation for the planted clique problem. Specifically, weâ€¦Â (More)

Is this relevant?

2013

2013

- Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Vempala, Ying Xiao
- STOC
- 2013

We introduce a framework for proving lower bounds on computational problems over distributions against algorithms that can beâ€¦Â (More)

Is this relevant?

2013

2013

We consider the problem of identifying the densest k-node subgraph in a given graph. We write this problem as an instance of rankâ€¦Â (More)

Is this relevant?

2012

2012

- Raj Rao Nadakuditi
- 2012 IEEE Statistical Signal Processing Workshopâ€¦
- 2012

We study the problem of detecting or discovering a planted clique embedded in a random graph. Using recent results from randomâ€¦Â (More)

Is this relevant?

2012

2012

- Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Vempala, Ying Xiao
- Electronic Colloquium on Computational Complexity
- 2012

We develop a framework for proving lower bounds on computational problems over distributions, including optimization andâ€¦Â (More)

Is this relevant?

2012

2012

We introduce a framework for proving lower bounds on computational problems over distributions, for a class of algorithms calledâ€¦Â (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- Brendan P. W. Ames, Stephen A. Vavasis
- Math. Program.
- 2011

We consider the problems of finding a maximum clique in a graph and finding a maximum-edge biclique in a bipartite graph. Bothâ€¦Â (More)

Is this relevant?

2011

2011

A clique of a graph G is a set of pairwise adjacent nodes of G. Similarly, a biclique<lb>(U, V ) of a bipartite graph G is a pairâ€¦Â (More)

Is this relevant?

2008

2008

- Alan M. Frieze, Ravi Kannan
- FSTTCS
- 2008

It is well known that finding the largest clique in a graph is NP-hard, [8]. Indeed, Hastad [5] has shown that it is NP-hard toâ€¦Â (More)

Is this relevant?