Approximating CVP to within almost-polynomial factors is NP-hard

From MaRDI portal

(Redirected from Publication:1878613)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Approximating_CVP_to_within_almost-polynomial_factors_is_NP-hard&oldid=69176547"