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 47 items.
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786) (← links)
- Proof Complexity Meets Algebra (Q4617977) (← links)
- Query-Efficient Dictatorship Testing with Perfect Completeness (Q4933378) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (Q4993301) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- Approximating Unique Games Using Low Diameter Graph Decomposition (Q5002621) (← links)
- Fundamental Domains for Symmetric Optimization: Construction and Search (Q5003215) (← links)
- Parameterized Complexity of Multi-Node Hubs (Q5009470) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- Disordered systems insights on computational hardness (Q5055432) (← links)
- Fast Distributed Approximation for Max-Cut (Q5056049) (← links)
- Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem (Q5075818) (← links)
- (Q5077145) (← links)
- Constrained Assortment Optimization Under the Paired Combinatorial Logit Model (Q5080643) (← links)
- Probabilistic view of voting, paradoxes, and manipulation (Q5081545) (← links)
- (Q5090458) (← links)
- (Q5090928) (← links)
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (Q5091245) (← links)
- UG-hardness to NP-hardness by losing half (Q5091753) (← links)
- 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)
- (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)
- Recent Theoretical Advances in Non-Convex Optimization (Q6355806) (← links)