Fetching the paper…
Reading the bibliography…
We consider the problems of finding a maximum clique in a graph and finding a maximum-edge biclique in a bipartite graph.
Probability inequalities for sums of bounded random variables
W. Hoeffding · 1962
Earlier work this paper cites.
Computers and Intractability: A Guide to the Theory of NP-Completeness
M. R. Garey and D. S. Johnson · 1979
Earlier work this paper cites.
A limit theorem for the norm of random matrices
Stuart Geman · 1980
Earlier work this paper cites.
The eigenvalues of random symmetric matrices
Z. Füredi and J. Komlós · 1981
Earlier work this paper cites.
Characterization of the subdifferential of some matrix norms
G. A. Watson · 1992
Earlier work this paper cites.
Finding a large hidden clique in a random graph
N. Alon, M. Krivelevich, and B. Sudakov · 1998
Earlier work this paper cites.
Finding and certifying a large hidden clique in a semirandom graph
Uriel Feige and Robert Krauthgamer · 2000
Cited alongside, same era.
Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
L.D. Iasemidis, P. Pardalos, J. C. Sackellares, and D.-S. Shiau · 2001
Cited alongside, same era.
Spectral partitioning of random graphs
F. McSherry · 2001
Cited alongside, same era.
Near-optimal sparse fourier representations via sampling
A. C. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, and M. Strauss · 2002
Cited alongside, same era.
The maximum edge biclique problem is NP-complete
R. Peeters · 2003
Cited alongside, same era.
Probability and computing
Michael Mitzenmacher and Eli Upfal · 2005
Cited alongside, same era.
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
E.J. Candès, J. Romberg, and T. Tao · 2006
Later among the works it cites.
Compressed sensing
D.L. Donoho · 2006
Later among the works it cites.
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization, 2007
Benjamin Recht, Maryam Fazel, and Pablo A. Parrilo · 2007
Later among the works it cites.
Which data sets are ‘clusterable’? - a theoretical study of clusterability
Margareta Ackerman and Shai Ben-David · 2008
Later among the works it cites.
Exact matrix completion via convex optimization
Emmanuel J. Candès and Benjamin Recht · 2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
N. Gillis and F. Glineur · 2008
Later among the works it cites.