ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING (Q3449656)

From MaRDI portal
scientific article
Language Label Description Also known as
English
ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING
scientific article

    Statements

    ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING (English)
    0 references
    0 references
    0 references
    0 references
    4 November 2015
    0 references
    0 references
    quantum algorithm
    0 references
    prime factoring
    0 references
    computational complexity
    0 references
    0 references