Answers are grounded in this paper and cite their sources.
We study the hardness of the $γ$-approximate decisional Covering Radius Problem on lattices in the ₚ norm ($γ$-GapCRPₚ). Specifically, we prove that there is an explicit function $γ(p)$, with $γ(p) > 1$ for p > p₀ ≈ 35.31 and limp → ∞ γ(p) = 9/8, such that for any constant ε > 0, (γ(p) - ε)-GapCRPₚ is NP-hard. This shows the first hardness of GapCRPₚ for explicit p < ∞. Work of Haviv and Regev (CCC, 2006 and CJTCS, 2012) previously showed Π₂-hardness of approximation for GapCRPₚ for all sufficiently large (but non-explicit) finite p and for p = ∞. In fact, our hardness results hold for a variant of GapCRP called the Binary Covering Radius Problem (BinGapCRP), which trivially reduces to both GapCRP and the decisional Linear Discrepancy Problem (LinDisc) in any norm in an approximation-preserving way. We also show Π₂-hardness of (9/8 - ε)-BinGapCRP in the ∞ norm for any constant ε > 0. Our work extends and heavily uses the work of Manurangsi (IPL, 2021), which showed Π₂-hardness of (9/8 - ε)-LinDisc in the ∞ norm.
No takes yet. Share an insight, caveat, or question.
Bennett et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: