scientific article; zbMATH DE number 5968943
From MaRDI portal
Publication:3096201
Recommendations
- On the rank of a random binary matrix
- On the rank of a random binary matrix
- An entropy estimate for the problem of location of ones in a binary matrix
- On the Complexity of Recovering Incidence Matrices
- Probabilistic lower bounds on maximal determinants of binary matrices
- Reconstruction of binary matrices under fixed size neighborhood constraints
- scientific article; zbMATH DE number 4006440
- On reconstruction of binary codes by dimensions of their subcodes
- On the rank of random binary matrix with fixed weights of independent rows
- On sparse random combinatorial matrices
Cited in
(12)- Superboolean rank and the size of the largest triangular submatrix of a random matrix
- Significance and Recovery of Block Structures in Binary Matrices with Noise
- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices
- Two-sample hypothesis testing for inhomogeneous random graphs
- Two-dimensional pattern matching against local and regular-like picture languages
- Optimal detection of sparse principal components in high dimension
- Nondeterministic communication complexity of random Boolean functions (extended abstract)
- Finding large co-Sidon subsets in sets with a given additive energy
- Optimality and sub-optimality of PCA. I: Spiked random matrix models
- On the maximal size of large-average and ANOVA-fit submatrices in a Gaussian random matrix
- Community detection in sparse random networks
- Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3096201)
