Pages that link to "Item:Q5501953"
From MaRDI portal
The following pages link to The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ <sub>1</sub> (Q5501953):
Displaying 39 items.
- On a class of metrics related to graph layout problems (Q603106) (← links)
- Small bipartite subgraph polytopes (Q613319) (← links)
- Spectral algorithms for unique games (Q645126) (← links)
- Noise stability of functions with low influences: invariance and optimality (Q974039) (← links)
- Differentiating maps into \(L^1\), and the geometry of BV functions (Q974067) (← links)
- Vertical perimeter versus horizontal perimeter (Q1643390) (← links)
- Gaussian noise sensitivity and Fourier tails (Q1650030) (← links)
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
- Random constructions in Bell inequalities: a survey (Q1735892) (← links)
- Quasimetric embeddings and their applications (Q1799224) (← links)
- Strong reductions for extended formulations (Q1801022) (← links)
- Tight inapproximability of minimum maximal matching on bipartite graphs and related problems (Q2085735) (← links)
- On \(L_1\)-embeddability of unions of \(L_1\)-embeddable metric spaces and of twisted unions of hypercubes (Q2087476) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time (Q2164684) (← links)
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (Q2475406) (← links)
- Generalized differentiation and bi-Lipschitz nonembedding in \(L^{1}\) (Q2504712) (← links)
- Negative-type diversities, a multi-dimensional analogue of negative-type metrics (Q2659479) (← links)
- Bisection of bounded treewidth graphs by convolutions (Q2662673) (← links)
- Mean isoperimetry with control on outliers: exact and approximation algorithms (Q2672637) (← links)
- Survey on nonlocal games and operator space theory (Q2786626) (← links)
- On Khot’s unique games conjecture (Q3109809) (← links)
- The Andoni–Krauthgamer–Razenshteyn Characterization of Sketchable Norms Fails for Sketchable Metrics (Q3384132) (← links)
- Minimum Bisection Is Fixed-Parameter Tractable (Q4634024) (← links)
- (Q5009507) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- Superlinear Integrality Gaps for the Minimum Majority Problem (Q5020845) (← links)
- (Q5075784) (← links)
- UG-hardness to NP-hardness by losing half (Q5091753) (← links)
- Diversity-normed spaces and diversity embeddings (Q5097200) (← links)
- Computational topology and the Unique Games Conjecture (Q5115811) (← links)
- Bi-Lipschitz embeddings of Heisenberg submanifolds into Euclidean spaces (Q5118938) (← links)
- The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ <sub>1</sub> (Q5501953) (← links)
- (Q5743436) (← links)
- Expanders with respect to Hadamard spaces and random graphs (Q5919792) (← links)
- Linear‐time algorithms for eliminating claws in graphs (Q6082274) (← links)
- Pseudorandom sets in Grassmann graph have near-perfect expansion (Q6101019) (← links)
- (Q6176154) (← links)
- Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)
