Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions
From MaRDI portal
(Redirected from Approximating the SVP to within a factor (1+1/^) is NP-hard under randomized reductions)
Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions
Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
