Pages that link to "Item:Q4636446"
From MaRDI portal
The following pages link to Near-Optimal UGC-hardness of Approximating Max k-CSP_R (Q4636446):
Displaying 7 items.
- Tight bounds on the approximability of almost-satisfiable Horn SAT and exact hitting set (Q2913811) (← links)
- A characterization of hard-to-cover CSPs (Q4601833) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- Near-optimal NP-hardness of approximating \textsc{Max} \(k\)-\(\mathrm{CSP}_R\) (Q5077145) (← links)
- UG-hardness to NP-hardness by losing half (Q5091753) (← links)
- (Q5743431) (← links)