Recommendations
Cited in
(17)- Propagation Connectivity of Random Hypergraphs
- On the complexity of random satisfiability problems with planted solutions
- Regularity properties for sparse regression
- An algorithmic regularity lemma for L_p regular sparse matrices
- Grothendieck-type inequalities in combinatorial optimization
- Zero-one rounding of singular vectors
- An efficient sparse regularity concept
- Faster random k-CNF satisfiability
- A relative Szemerédi theorem
- Quick approximation to matrices and applications
- Extremal results in sparse pseudorandom graphs
- A spectral approach to approximately counting independent sets in dense bipartite graphs
- Note on strong refutation algorithms for random \(k\)-SAT formulas
- Approximating sparse binary matrices in the cut-norm
- SPARSE PARTITION REGULARITY
- An L^p theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
- The Geometry of Sparse Analysis Regularization
This page was built for publication: An efficient sparse regularity concept
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058542)
