The bit-complexity of arithmetic algorithms (Q3928236)

From MaRDI portal
Revision as of 14:31, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The bit-complexity of arithmetic algorithms
scientific article

    Statements

    title
    The bit-complexity of arithmetic algorithms (English)
    0 references
    author
    Pan, Victor Y.
    0 references
    publication date
    1981
    0 references
    zbMATH DE Number
    3742610
    0 references
    zbMATH Keywords
    time-complexity
    0 references
    space-complexity
    0 references
    discrete Fourier transform
    0 references
    polynomial multiplication
    0 references
    arithmetic complexity
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3928236&oldid=28200477"
    Powered by MediaWiki