Pages that link to "Item:Q3058542"
From MaRDI portal
The following pages link to An Efficient Sparse Regularity Concept (Q3058542):
Displaying 15 items.
- Regularity properties for sparse regression (Q279682) (← links)
- Approximating sparse binary matrices in the cut-norm (Q498332) (← links)
- Quick approximation to matrices and applications (Q1125616) (← links)
- Computing sparse approximations deterministically (Q1915603) (← links)
- A relative Szemerédi theorem (Q2355780) (← links)
- Extremal results in sparse pseudorandom graphs (Q2445889) (← links)
- Note on strong refutation algorithms for random \(k\)-SAT formulas (Q2840534) (← links)
- Grothendieck-type inequalities in combinatorial optimization (Q2892967) (← links)
- SPARSE PARTITION REGULARITY (Q3419033) (← links)
- Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions (Q5227976) (← links)
- An Algorithmic Regularity Lemma for $L_p$ Regular Sparse Matrices (Q5371027) (← links)
- Propagation Connectivity of Random Hypergraphs (Q5902240) (← links)
- The Geometry of Sparse Analysis Regularization (Q6158006) (← links)
