Lattice problems beyond polynomial time (Q6499316)

From MaRDI portal
Revision as of 14:43, 3 December 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7844689
Language Label Description Also known as
English
Lattice problems beyond polynomial time
scientific article; zbMATH DE number 7844689

    Statements

    title
    Lattice problems beyond polynomial time (English)
    0 references
    author
    Divesh Aggarwal
    0 references
    Huck Bennett
    0 references
    Zvika Brakerski
    0 references
    Alexander Golovnev
    0 references
    Rajendra Kumar
    0 references
    Zeyong Li
    0 references
    Spencer Peters
    0 references
    Vinod Vaikuntanathan
    0 references
    publication date
    8 May 2024
    0 references
    zbMATH Keywords
    lattice problems
    0 references
    closest vector problem
    0 references
    shortest vector problem
    0 references
    worst-case to average-case reductions
    0 references
    cites work
    Q5465355
    0 references
    Q4542515
    0 references
    Q6090904
    0 references
    Q3549702
    0 references
    Q2913823
    0 references
    Q5368736
    0 references

    Identifiers

    zbMATH DE Number
    7844689
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6499316&oldid=38018422"
    Powered by MediaWiki