Faster Polynomial Multiplication via Discrete Fourier Transforms (Q3007620)

From MaRDI portal
Revision as of 11:57, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Faster Polynomial Multiplication via Discrete Fourier Transforms
scientific article

    Statements

    title
    Faster Polynomial Multiplication via Discrete Fourier Transforms (English)
    0 references
    author
    Alexey Pospelov
    0 references
    publication date
    17 June 2011
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    65T50
    0 references
    68Q17
    0 references
    68W30
    0 references
    zbMATH DE Number
    5908673
    0 references
    zbMATH Keywords
    polynomial multiplication
    0 references
    discrete Fourier transform
    0 references
    algebraic complexity
    0 references
    lower bounds
    0 references
    OpenAlex ID
    W1526245840
    0 references
    arXiv ID
    1010.1101
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3007620&oldid=33586410"
    Powered by MediaWiki