Faster integer multiplication using plain vanilla FFT primes (Q4683179): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: gmp / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NTL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2550792289 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1611.07144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRIMES is in P / 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: Short character sums for composite moduli / 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: Discrete Weighted Transforms and Large-Integer 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: On the Least Prime in Certain Arithmetic Progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster arithmetic for number-theoretic transforms / 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: Faster Polynomial Multiplication over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost-primes in arithmetic progressions and short intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: SIEGEL ZEROS AND THE LEAST PRIME IN AN ARITHMETIC PROGRESSION / 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: Implementing Fast Carryless Multiplication / 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: 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: Fast multiplication of large numbers / 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: Modern Computer Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greatest of the Least Primes in Arithmetic Progressions Having a Given Modulus / 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 15:57, 16 July 2024

scientific article; zbMATH DE number 6939525
Language Label Description Also known as
English
Faster integer multiplication using plain vanilla FFT primes
scientific article; zbMATH DE number 6939525

    Statements

    Faster integer multiplication using plain vanilla FFT primes (English)
    0 references
    0 references
    0 references
    0 references
    20 September 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references