ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING (Q3449656)

From MaRDI portal
Revision as of 19:15, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING
scientific article

    Statements

    title
    ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING (English)
    0 references
    author
    Masanori Ohya
    0 references
    Satoshi Iriyama
    0 references
    Igor V. Volovich
    0 references
    publication date
    4 November 2015
    0 references
    zbMATH DE Number
    6504780
    0 references
    zbMATH Keywords
    quantum algorithm
    0 references
    prime factoring
    0 references
    computational complexity
    0 references
    OpenAlex ID
    W2491185298
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3449656&oldid=31279749"
    Powered by MediaWiki