Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) (Q5066949): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/3505584 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2923569601 / rank
 
Normal rank

Revision as of 20:01, 19 March 2024

scientific article; zbMATH DE number 7500718
Language Label Description Also known as
English
Polynomial Multiplication over Finite Fields in Time \( O(n \log n \)
scientific article; zbMATH DE number 7500718

    Statements

    Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) (English)
    0 references
    0 references
    0 references
    0 references
    31 March 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    polynomial multiplication
    0 references
    integer multiplication
    0 references
    algorithm
    0 references
    complexity bound
    0 references
    FFT
    0 references
    finite field
    0 references
    0 references
    0 references