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):
Displayed 22 items.
- Solution of the propeller conjecture in \(\mathbb R^3\) (Q368772) (← links)
- Angular synchronization by eigenvectors and semidefinite programming (Q617701) (← links)
- The Gaussian surface area and noise sensitivity of degree-\(d\) polynomial threshold functions (Q645127) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- Noise stability of functions with low influences: invariance and optimality (Q974039) (← links)
- Maximally stable Gaussian partitions with discrete applications (Q1760364) (← links)
- Noise correlation bounds for uniform low degree functions (Q1944763) (← links)
- Gaussian bounds for noise correlation of functions (Q2379368) (← links)
- The maximum cut problem on blow-ups of multiprojective spaces (Q2435039) (← links)
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693) (← links)
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (Q2475406) (← links)
- Pricing loss leaders can be hard (Q2637290) (← links)
- Column subset selection problem is UG-hard (Q2637653) (← links)
- Some applications of hypercontractive inequalities in quantum information theory (Q2872466) (← links)
- Grothendieck-Type Inequalities in Combinatorial Optimization (Q2892967) (← links)
- On Khot’s unique games conjecture (Q3109809) (← links)
- Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs (Q3145840) (← links)
- Approximability Distance in the Space of H-Colourability Problems (Q3392945) (← links)
- Approximate Kernel Clustering (Q3400770) (← links)
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786) (← links)
- Query-Efficient Dictatorship Testing with Perfect Completeness (Q4933378) (← links)
- THE GROTHENDIECK CONSTANT IS STRICTLY SMALLER THAN KRIVINE’S BOUND (Q5401649) (← links)