Pages that link to "Item:Q2931398"
From MaRDI portal
The following pages link to Conditional hardness for approximate coloring (Q2931398):
Displaying 14 items.
- A note on unique games (Q845686) (← links)
- Noise stability of functions with low influences: invariance and optimality (Q974039) (← links)
- A simple algorithm for 4-coloring 3-colorable planar graphs (Q974757) (← links)
- On the tractability of coloring semirandom graphs (Q975431) (← links)
- Maximally stable Gaussian partitions with discrete applications (Q1760364) (← links)
- A quantitative Arrow theorem (Q1930856) (← links)
- Robust optimality of Gaussian noise stability (Q2019201) (← links)
- Gaussian bounds for noise correlation of functions (Q2379368) (← links)
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (Q2475406) (← links)
- New Tools for Graph Coloring (Q3088076) (← links)
- Deciding Relaxed Two-Colourability: A Hardness Jump (Q3557504) (← links)
- Conditional Hardness for Approximate Coloring (Q3575151) (← links)
- (Q5091214) (← links)
- Two generalizations of proper coloring: hardness and approximability (Q6168932) (← links)