ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1304.7047
  4. Cited By
Finding Hidden Cliques of Size \sqrt{N/e} in Nearly Linear Time

Finding Hidden Cliques of Size \sqrt{N/e} in Nearly Linear Time

26 April 2013
Y. Deshpande
Andrea Montanari
ArXivPDFHTML

Papers citing "Finding Hidden Cliques of Size \sqrt{N/e} in Nearly Linear Time"

2 / 2 papers shown
Title
Computational Lower Bounds for Sparse PCA
Computational Lower Bounds for Sparse PCA
Quentin Berthet
Philippe Rigollet
66
93
0
03 Apr 2013
On combinatorial testing problems
On combinatorial testing problems
L. Addario-Berry
N. Broutin
Luc Devroye
Gábor Lugosi
104
114
0
24 Aug 2009
1