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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q114071088 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: New algorithms for digital convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRIMES is in P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern Computer Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fast multiplication of polynomials over arbitrary algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Machine Calculation of Complex Fourier Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast integer multiplication using generalized Fermat primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Integer Multiplication Using Modular Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Integer Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern Computer Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster arithmetic for number-theoretic transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster polynomial multiplication over finite fields using cyclotomic coefficient rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster integer multiplication using plain vanilla FFT primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster integer multiplication using short lattice vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer multiplication in time \(O(n\log n)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Polynomial Multiplication over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even faster integer multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Polynomial Multiplication over F <sub>2</sub> <sub>60</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gauss and the history of the fast Fourier transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relax, but don't be too lazy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Fast Carryless Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4346406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the least prime in an Arithmetic progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3253764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast polynomial transform algorithms for digital convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of Convolutions and Discrete Fourier Transforms by Polynomial Transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fast Fourier Transform in a Finite Field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplikation großer Zahlen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of polynomials over fields of characteristic 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate power series multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms for Finding Irreducible Polynomials Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for Primitive Roots in Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding primitive roots in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3248912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5601777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the least prime in an arithmetic progression and estimates for the zeros of Dirichlet L-functions / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:05, 28 July 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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references