Hardness of approximating the shortest vector problem in lattices (Q3546301)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Hardness of approximating the shortest vector problem in lattices
scientific article

    Statements

    Hardness of approximating the shortest vector problem in lattices (English)
    0 references
    0 references
    21 December 2008
    0 references
    approximation algorithms
    0 references
    cryptography
    0 references
    hardness of approximation
    0 references
    lattices
    0 references
    shortest vector problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references