Fetching the paper…
Reading the bibliography…
We are given a graph $G$ with $n$ vertices, where a random subset of $k$ vertices has been made into a clique, and the remaining edges are chosen independently with probability $\tfrac12$.
The accuracy of the Gaussian approximation to the sum of independent variates
A. C. Berry · 1941
Earlier work this paper cites.
On the Liapunoff limit of error in the theory of probability
C. G. Esseen · 1942
Earlier work this paper cites.
Spectral partitioning of random graphs
F. McSherry · 1942
Earlier work this paper cites.
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
M. Abramowitz and I. A. Stegun · 1964
Earlier work this paper cites.
Reducibility among combinatorial problems
R. M. Karp · 1972
Earlier work this paper cites.
On colouring random graphs
G. Grimmett and C. McDiarmid · 1975
Earlier work this paper cites.
On the method of bounded differences
C. McDiarmid · 1989
Earlier work this paper cites.
Approximating clique is almost NP-complete (preliminary version)
U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy · 1991
Earlier work this paper cites.
A generalized encryption scheme based on random graphs
L. Kucera · 1991
Earlier work this paper cites.
Proof verification and hardness of approximation problems
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy · 1992
Cited alongside, same era.
Large cliques elude the metropolis process
M. Jerrum · 1992
Cited alongside, same era.
Expected complexity of graph partitioning problems
L. Kučera · 1995
Cited alongside, same era.
Finding a large hidden clique in a random graph
N. Alon, M. Krivelevich, and B. Sudakov · 1998
Cited alongside, same era.
Probabilistic checking of proofs: A new characterization of np
S. Arora and S. Safra · 1998
Cited alongside, same era.
Clustering gene expression patterns
A. Ben-Dor, R. Shamir, and Z. Yakhini · 1999
Cited alongside, same era.
Finding a randomly planted assignment in a random 3CNF, 2002
E. Ben Sasson, Y. Bilu, and D. Gutfreund · 2002
Later among the works it cites.
The probable value of the lovász–schrijver relaxations for maximum independent set
U. Feige and R. Krauthgamer · 2003
Later among the works it cites.
Solving random satisfiable 3CNF formulas in expected polynomial time
M. Krivelevich and D. Vilenchik · 2006
Later among the works it cites.
Testing k-wise and almost k-wise independence
N. Alon, A. Andoni, T. Kaufman, K. Matulef, R. Rubinfeld, and N. Xie · 2007
Later among the works it cites.
A new approach to the planted clique problem
A. M. Frieze and R. Kannan · 2008
Later among the works it cites.
How hard is it to approximate the best nash equilibrium?
E. Hazan and R. Krauthgamer · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
U. Feige and R. Krauthgamer · 2000
Cited alongside, same era.
Hiding cliques for cryptographic security
A. Juels and M. Peinado · 2000
Cited alongside, same era.
Probability: Theory and Examples
R. Durrett · 2010
Closest in time.
Finding hidden cliques in linear time
U. Feige and D. Ron · 2010
Closest in time.