The following pages link to (Q3096201):
Displaying 11 items.
- Two-sample Hypothesis Testing for Inhomogeneous Random Graphs (Q126111) (← links)
- Optimal detection of sparse principal components in high dimension (Q385763) (← links)
- Community detection in sparse random networks (Q894814) (← links)
- Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time (Q896557) (← links)
- Optimality and sub-optimality of PCA. I: Spiked random matrix models (Q1800806) (← links)
- On the maximal size of large-average and ANOVA-fit submatrices in a Gaussian random matrix (Q1940759) (← links)
- Two-dimensional pattern matching against local and regular-like picture languages (Q2029490) (← links)
- Finding large co-Sidon subsets in sets with a given additive energy (Q2509703) (← links)
- Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract) (Q2988848) (← links)
- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices (Q5041266) (← links)
- Superboolean rank and the size of the largest triangular submatrix of a random matrix (Q5496264) (← links)
