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 50 items.
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- Pricing loss leaders can be hard (Q2637290) (← links)
- Column subset selection problem is UG-hard (Q2637653) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- Low correlation noise stability of symmetric sets (Q2664537) (← links)
- Hypercontractivity via tensor calculus (Q2695312) (← links)
- The approximability of constraint satisfaction problems (Q2706139) (← links)
- Exponential lower bounds for polytopes in combinatorial optimization (Q2796404) (← links)
- Relaxations of Combinatorial Problems Via Association Schemes (Q2802525) (← links)
- Robustly solvable constraint satisfaction problems (Q2817797) (← links)
- Hardness of MAX-2Lin and MAX-3Lin over integers, reals, and large cyclic groups (Q2828232) (← links)
- Some applications of hypercontractive inequalities in quantum information theory (Q2872466) (← links)
- Grothendieck-type inequalities in combinatorial optimization (Q2892967) (← links)
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- A priori TSP in the Scenario Model (Q2971168) (← links)
- SDP gaps and UGC-hardness for max-cut-gain (Q3002802) (← links)
- On Khot’s unique games conjecture (Q3109809) (← links)
- Minimum Cell Connection in Line Segment Arrangements (Q3132917) (← links)
- Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs (Q3145840) (← links)
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
- Max-Cut Under Graph Constraints (Q3186491) (← links)
- Approximability Distance in the Space of H-Colourability Problems (Q3392945) (← links)
- Approximate Kernel Clustering (Q3400770) (← links)
- Approximating CSPs Using LP Relaxation (Q3448840) (← links)
- Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
- Making the Long Code Shorter (Q3449561) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786) (← links)
- Gadgets, Approximation, and Linear Programming (Q4507337) (← 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)
- Near-optimal NP-hardness of approximating \textsc{Max} \(k\)-\(\mathrm{CSP}_R\) (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)
