Pages that link to "Item:Q1886453"
From MaRDI portal
The following pages link to Random sampling and approximation of MAX-CSPs (Q1886453):
Displayed 18 items.
- Optimal cuts and partitions in tree metrics in polynomial time (Q396629) (← links)
- Approximating sparse binary matrices in the cut-norm (Q498332) (← links)
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing (Q952421) (← links)
- Bounds for graph regularity and removal lemmas (Q1930904) (← links)
- Optimal graphon estimation in cut distance (Q2312687) (← links)
- Moments of two-variable functions and the uniqueness of graph limits (Q2379365) (← links)
- A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
- Co-clustering separately exchangeable network data (Q2448722) (← links)
- Numerical multilinear algebra and its applications (Q2477577) (← links)
- Grothendieck-Type Inequalities in Combinatorial Optimization (Q2892967) (← links)
- Testing Odd-Cycle-Freeness in Boolean Functions (Q3168444) (← links)
- Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1. (Q4603696) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- The Cut Metric for Probability Distributions (Q4992835) (← links)
- Sublinear Algorithms for MAXCUT and Correlation Clustering (Q5002682) (← links)
- Amplification and Derandomization without Slowdown (Q5129234) (← links)
- (Q5743465) (← links)
- Hypergraph regularity and random sampling (Q6076218) (← links)