Hardness of approximating the shortest vector problem in lattices

Khot, S. (2005). Hardness of approximating the shortest vector problem in lattices. ACM.

Type

Unclassified

Intellectual base

Unclassified

Year

2005

DOI

10.1145/1089023.1089027

Link

https://doi.org/10.1145/1089023.1089027

Cited by

1 citation across 1 artifact.

Domain-specific

• Lattice problem
  • Lattice problems ask for geometrically special points in a discrete additive subgroup represented by a basis.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:8054cb577592 · see in the full table