SVP in any finite ℓ_p norm is hard to approximate within 2^{(log n)^{1-o(1)}} via deterministic reduction assuming NP not in subexponential time.
Then for allζ∈[0,1]and for all subsets Π′ containing aζfraction of the vertices inH, the fraction of hyperedges inHthat have all of their endpoints inΠ ′ is at mostζ d + 1/220d
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Deterministic Hardness of Approximation For SVP in all Finite $\ell_p$ Norms
SVP in any finite ℓ_p norm is hard to approximate within 2^{(log n)^{1-o(1)}} via deterministic reduction assuming NP not in subexponential time.