Pages that link to "Item:Q3191593"
From MaRDI portal
The following pages link to Circumventing \(d\)-to-\(1\) for approximation resistance of satisfiable predicates strictly containing parity of width at least four (Q3191593):
Displaying 9 items.
- Parity is Positively Useless (Q2969637) (← links)
- Approximating CSPs Using LP Relaxation (Q3448840) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5217824) (← links)
- Nearly Optimal NP-Hardness of Unique Coverage (Q5269824) (← links)
- $(2+\varepsilon)$-Sat Is NP-hard (Q5363382) (← links)
- Approximation resistance on satisfiable instances for predicates with few accepting inputs (Q5495816) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5875467) (← links)
- Fitting metrics and ultrametrics with minimum disagreements (Q6670352) (← links)