Pages that link to "Item:Q5454254"
From MaRDI portal
The following pages link to Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? (Q5454254):
Displaying 37 items.
- Simultaneous max-cut is harder to approximate than max-cut (Q5092456) (← links)
- Half-Spaces with Influential Variable (Q5107661) (← links)
- Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
- Computational topology and the Unique Games Conjecture (Q5115811) (← links)
- Dimension Reduction for Polynomials over Gaussian Space and Applications (Q5121916) (← links)
- Three candidate plurality is stablest for small correlations (Q5154790) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- Biased halfspaces, noise sensitivity, and local Chernoff inequalities (Q5211012) (← links)
- THE GROTHENDIECK CONSTANT IS STRICTLY SMALLER THAN KRIVINE’S BOUND (Q5401649) (← links)
- Cones of multipowers and combinatorial optimization problems (Q5413066) (← links)
- Hypercontractivity, sum-of-squares proofs, and their applications (Q5415483) (← links)
- Some optimal inapproximability results (Q5441360) (← links)
- Majority is stablest (Q5495818) (← links)
- Majority is stablest: discrete and SoS (Q5741631) (← links)
- (Q5743406) (← links)
- (Q5743431) (← links)
- (Q5743433) (← links)
- (Q5875456) (← links)
- Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder (Q5875476) (← links)
- Approximating the Noise Sensitivity of a Monotone Boolean Function (Q5875511) (← links)
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving (Q5885581) (← links)
- Coreness of cooperative games with truncated submodular profit functions (Q5915546) (← links)
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis (Q6064054) (← links)
- Pseudorandom sets in Grassmann graph have near-perfect expansion (Q6101019) (← links)
- Max-Cut via Kuramoto-Type Oscillators (Q6168211) (← links)
- On the complexity of binary polynomial optimization over acyclic hypergraphs (Q6174810) (← links)
- (Q6176154) (← links)
- Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)
- Interactions of computational complexity theory and mathematics (Q6198725) (← links)
- Twenty-two new approximate proof labeling schemes (Q6535018) (← links)
- A review on quantum approximate optimization algorithm and its variants (Q6546559) (← links)
- Total completion time scheduling under scenarios (Q6574934) (← links)
- An experimental evaluation of semidefinite programming and spectral algorithms for max cut (Q6579779) (← links)
- Lower bounds of functions on finite abelian groups (Q6591628) (← links)
- Searching for (sharp) thresholds in random structures: where are we now? (Q6658193) (← links)
- Dimension-free discretizations of the uniform norm by small product sets (Q6664374) (← links)
- Fitting metrics and ultrametrics with minimum disagreements (Q6670352) (← links)
