An efficient sparse regularity concept
From MaRDI portal
Publication:3058542
DOI10.1137/080730160zbMATH Open1207.05195DBLPjournals/siamdm/Coja-OghlanCF10OpenAlexW2010271471WikidataQ57401457 ScholiaQ57401457MaRDI QIDQ3058542FDOQ3058542
Authors: Amin Coja-Oghlan, Colin Cooper, Alan Frieze 
Publication date: 3 December 2010
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/43226/1/WRAP_Coja-Oghlan_sparsreg.pdf
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Hypergraphs (05C65)
Cited In (15)
- On the complexity of random satisfiability problems with planted solutions
- Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization
- Regularity properties for sparse regression
- An algorithmic regularity lemma for \(L_p\) regular sparse matrices
- Grothendieck-type inequalities in combinatorial optimization
- An đż^{đ} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
- Zero-one rounding of singular vectors
- An efficient sparse regularity concept
- A relative Szemerédi theorem
- Extremal results in sparse pseudorandom graphs
- Note on strong refutation algorithms for random \(k\)-SAT formulas
- Approximating sparse binary matrices in the cut-norm
- SPARSE PARTITION REGULARITY
- The Geometry of Sparse Analysis Regularization
- Propagation Connectivity of Random Hypergraphs
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)
