The following pages link to (Q4250228):
Displaying 17 items.
- Finding one community in a sparse graph (Q892403) (← links)
- Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191) (← links)
- Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time (Q896557) (← links)
- A simple spectral algorithm for recovering planted partitions (Q1678989) (← links)
- New bounds for the CLIQUE-GAP problem using graph decomposition theory (Q1709587) (← links)
- Notes on computational-to-statistical gaps: predictions using statistical physics (Q1729830) (← links)
- On the hardness of designing public signals (Q2278949) (← links)
- Exact recovery in the Ising blockmodel (Q2313270) (← links)
- Computational barriers in minimax submatrix detection (Q2352736) (← links)
- Energy landscape for large average submatrix detection problems in Gaussian random matrices (Q2363657) (← links)
- Finding large cliques in sparse semi-random graphs by simple randomized search heuristics (Q2455599) (← links)
- Testing for high-dimensional geometry in random graphs (Q2830237) (← links)
- New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory (Q2946384) (← links)
- Random Instances of Problems in NP – Algorithms and Statistical Physics (Q3464473) (← links)
- Submatrix localization via message passing (Q4558513) (← links)
- A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (Q4634034) (← links)
- Optimal group testing (Q5886113) (← links)
