A polynomial-time algorithm for solving the hidden subset sum problem (Q2096513)

From MaRDI portal
Revision as of 22:58, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A polynomial-time algorithm for solving the hidden subset sum problem
scientific article

    Statements

    title
    A polynomial-time algorithm for solving the hidden subset sum problem (English)
    0 references
    author
    Jean-Sébastien Coron
    0 references
    Agnese Gini
    0 references
    publication date
    9 November 2022
    0 references
    zbMATH DE Number
    7614561
    0 references
    zbMATH Keywords
    Nguyen-Stern algorithm
    0 references
    lattice based algorithm
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2096513&oldid=14595647"
    Powered by MediaWiki