Pages that link to "Item:Q3068639"
From MaRDI portal
The following pages link to Towards Sharp Inapproximability for Any 2-CSP (Q3068639):
Displayed 12 items.
- Enumerating homomorphisms (Q414933) (← links)
- Spectral algorithms for unique games (Q645126) (← links)
- Noise stability of functions with low influences: invariance and optimality (Q974039) (← links)
- Simple approximation algorithms for balanced MAX~2SAT (Q1742374) (← links)
- Maximally stable Gaussian partitions with discrete applications (Q1760364) (← links)
- Robust optimality of Gaussian noise stability (Q2019201) (← links)
- Gaussian bounds for noise correlation of resilient functions (Q2303682) (← links)
- Oblivious algorithms for the maximum directed cut problem (Q2346965) (← links)
- Lower Bounds for the Graph Homomorphism Problem (Q3448809) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds (Q5269825) (← links)
- (Q6058189) (← links)