Pages that link to "Item:Q5495836"
From MaRDI portal
The following pages link to Statistical algorithms and a lower bound for detecting planted cliques (Q5495836):
Displaying 14 items.
- Optimal detection of sparse principal components in high dimension (Q385763) (← 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)
- Recovering nonuniform planted partitions via iterated projection (Q2002551) (← links)
- Statistical and computational limits for sparse matrix detection (Q2196237) (← links)
- Optimal testing for planted satisfiability problems (Q2259537) (← links)
- On the hardness of designing public signals (Q2278949) (← links)
- Statistical active learning algorithms for noise tolerance and differential privacy (Q2345952) (← links)
- Computational barriers in minimax submatrix detection (Q2352736) (← links)
- Community detection in dense random networks (Q2510823) (← links)
- Algebraic Attacks against Random Local Functions and Their Countermeasures (Q4600698) (← links)
- On the Power of Learning from k-Wise Queries (Q4638095) (← links)
- (Q5091194) (← links)
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
