Pages that link to "Item:Q4948021"

The following pages link to Finding and certifying a large hidden clique in a semirandom graph (Q4948021):

Displayed 28 items.

• Optimal detection of sparse principal components in high dimension (Q385763) ‎ (← links)
• Certifying algorithms (Q465678) ‎ (← links)
• On combinatorial testing problems (Q605939) ‎ (← links)
• Nuclear norm minimization for the planted clique and biclique problems (Q717132) ‎ (← links)
• Independent sets in semi-random hypergraphs (Q832900) ‎ (← links)
• Finding one community in a sparse graph (Q892403) ‎ (← links)
• Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191) ‎ (← links)
• Heuristics for semirandom graph problems (Q1604213) ‎ (← links)
• A simple spectral algorithm for recovering planted partitions (Q1678989) ‎ (← links)
• Recovering nonuniform planted partitions via iterated projection (Q2002551) ‎ (← links)
• On the computational tractability of statistical estimation on amenable graphs (Q2067660) ‎ (← links)
• Nearly optimal robust secret sharing against rushing adversaries (Q2102061) ‎ (← links)
• Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) ‎ (← links)
• Cliques in rank-1 random graphs: the role of inhomogeneity (Q2278662) ‎ (← links)
• On the hardness of designing public signals (Q2278949) ‎ (← links)
• Exact recovery in the hypergraph stochastic block model: a spectral algorithm (Q2310389) ‎ (← links)
• Computational barriers in minimax submatrix detection (Q2352736) ‎ (← links)
• Do semidefinite relaxations solve sparse PCA up to the information limit? (Q2352742) ‎ (← links)
• Convex optimization for the planted \(k\)-disjoint-clique problem (Q2436653) ‎ (← links)
• Finding large cliques in sparse semi-random graphs by simple randomized search heuristics (Q2455599) ‎ (← links)
• On independent sets in random graphs (Q3452727) ‎ (← links)
• A Simple SVD Algorithm for Finding Hidden Partitions (Q4601058) ‎ (← links)
• Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation (Q4609470) ‎ (← links)
• (Q4969177) ‎ (← links)
• The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) ‎ (← links)
• Computational and statistical tradeoffs via convex relaxation (Q5170958) ‎ (← links)
• Finding Hidden Cliques in Linear Time with High Probability (Q5414144) ‎ (← links)
• Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning (Q5870483) ‎ (← links)