Pages that link to "Item:Q1878613"
From MaRDI portal
The following pages link to Approximating CVP to within almost-polynomial factors is NP-hard (Q1878613):
Displayed 8 items.
- An improved lower bound for approximating minimum GCD multiplier in \(\ell _\infty \) norm (GCDM\(_\infty\)) (Q924126) (← links)
- Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636) (← links)
- A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. (Q1589481) (← links)
- Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard (Q1608337) (← links)
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor (Q1861566) (← links)
- The inapproximability of lattice and coding problems with preprocessing (Q1881262) (← links)
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms (Q2490259) (← links)
- A Digital Signature Scheme Based on CVP ∞ (Q5445459) (← links)