Integer multiplication in time O(n n)
From MaRDI portal
Publication:2662018
Recommendations
Cites work
- scientific article; zbMATH DE number 3140885 (Why is no real title available?)
- scientific article; zbMATH DE number 5595162 (Why is no real title available?)
- scientific article; zbMATH DE number 3471609 (Why is no real title available?)
- scientific article; zbMATH DE number 1196661 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1033192 (Why is no real title available?)
- A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Approximate formulas for some functions of prime numbers
- Computation of Convolutions and Discrete Fourier Transforms by Polynomial Transforms
- Discrete Weighted Transforms and Large-Integer Arithmetic
- Even faster integer multiplication
- Fast Chinese remaindering in practice
- Fast Fourier Transforms for Nonequispaced Data
- Fast computation of discrete Fourier transforms using polynomial transforms
- Fast integer multiplication using generalized Fermat primes
- Fast integer multiplication using modular arithmetic
- Fast multiplication of large numbers
- Fast polynomial transform algorithms for digital convolution
- Faster integer multiplication
- Faster integer multiplication
- Faster integer multiplication using plain vanilla FFT primes
- Faster integer multiplication using short lattice vectors
- Faster polynomial multiplication over finite fields
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- Faster relaxed multiplication
- Gauss and the history of the fast Fourier transform
- Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
- Modern computer algebra
- Modern computer arithmetic
- New algorithms for digital convolution
- On the Minimum Computation Time of Functions
- On the complexity of integer matrix multiplication
- On the least prime in an arithmetic progression and estimates for the zeros of Dirichlet L-functions
- The Fast Fourier Transform in a Finite Field
Cited in
(88)- A unified FFT-based approach to maximum assignment problems related to transitive finite group actions
- Polynomial modular product verification and its implications
- Fast multiplication and its applications
- Rate-1 arithmetic garbling from homomorphic secret sharing
- Fast exact algorithms using Hadamard product of polynomials
- Computing supersingular endomorphism rings using inseparable endomorphisms
- Linear average-case complexity of algorithmic problems in groups
- The I/O complexity of Toom-Cook integer multiplication
- Quantum generalized least squares method in system identification
- Faster integer multiplication
- Computing Euler factors of genus 2 curves at odd primes of almost good reduction
- Complexity analysis of algorithm for multiplication of superlarge numbers based on Walsh coefficients
- The Karatsuba integer middle product
- Computational Number Theory, Past, Present, and Future
- Tensors in computations
- Discrete Weighted Transforms and Large-Integer Arithmetic
- Time-space tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential random-access computer
- Uniformly generating derangements with fixed number of cycles in polynomial time
- An exponent one-fifth algorithm for deterministic integer factorisation
- Schönhage-Strassen algorithm with MapReduce for multiplying terabit integers
- Fuchsian holonomic sequences
- On the complexity of integer matrix multiplication
- Searching for differential addition chains
- Counting points on smooth plane quartics
- A hybrid classical-quantum algorithm for solution of nonlinear ordinary differential equations
- Faster integer multiplication using short lattice vectors
- Fast norm computation in smooth-degree abelian number fields
- Large integer multiplication on hypercubes
- Representation of numbers with negative digits and multiplication of small integers
- A generalized MSST algorithm for counting points of elliptic curves over \(\mathbb{F}_{p^n}\)
- Hypergeometric L-functions in average polynomial time. II
- Straight-line drawings of 1-planar graphs
- Quantum attribute-based encryption: a comprehensive study
- On oracle factoring of integers
- Even faster integer multiplication
- Efficient and validated numerical evaluation of abelian integrals
- Beating binary powering for polynomial matrices
- Space-efficient and noise-robust quantum factoring
- Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms
- Fast interpolation and multiplication of unbalanced polynomials
- Lucas-Lehmer primality tests for certain prime curios
- A new bound on cofactors of sparse polynomials
- A Kronecker algorithm for locally closed sets over a perfect field
- Doubly isogenous curves of genus two with a rational action of D₆
- A fast algorithm for computing the number of magic series
- Efficient Generic Quotients Using Exact Arithmetic
- Direct access for conjunctive queries with negations
- New ways to garble arithmetic circuits
- Algorithmic counting of nonequivalent compact Huffman codes
- Polynomial multiplication over finite fields in time O(n n)
- Random generation of subgroups of the modular group with a fixed isomorphism type
- Fast multiplication of large numbers
- An efficient quantum factoring algorithm
- Extending Regev's quantum algorithm to elliptic curves
- Efficient quantum multi-authority attribute-based encryption and generalizations
- Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields
- Computing (N) for an RSA module with a single quantum query
- The quantum detection of projectors in finite-dimensional algebras and holography
- Reducing the number of qubits in quantum factoring
- DewTwo: a transparent PCS with quasi-linear prover, logarithmic verifier and 4.5KB proofs from falsifiable assumptions
- Faster truncated integer multiplication
- Efficient arithmetic in garbled circuits
- Ordering groups and the identity problem
- Faster integer multiplication
- How fast can we multiply large integers on an actual computer?
- Multiplication
- Summing \(\mu(n)\): a faster elementary algorithm
- A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm
- CryptAttackTester: high-assurance attack analysis
- Computing modular polynomials by deformation
- Scalable multiparty computation from non-linear secret sharing
- Space-efficient and noise-robust quantum factoring
- A new fast root-finder for black box polynomials
- On iterated integer product
- Uniformly polynomial-time classification of surface homeomorphisms
- Addition machines, automatic functions and open problems of Floyd and Knuth
- Characterization of the imbalance problem on complete bipartite graphs
- On the structure of random graphs with constant r-balls
- A rigorous extension of the Schönhage-Strassen integer multiplication algorithm using complex interval arithmetic
- Space- and time-efficient polynomial multiplication
- Fast interpolation of multivariate polynomials with sparse exponents
- Computing characteristic polynomials of p-curvatures in average polynomial time
- Fast integer multiplication using generalized Fermat primes
- A \(\log\)-\(\log\) speedup for exponent one-fifth deterministic integer factorisation
- The numerical solution of fractional integral equations via orthogonal polynomials in fractional powers
- Efficient Multiplication of Somewhat Small Integers Using Number-Theoretic Transforms
- Homomorphic encryption: a mathematical survey
- Computing \(L\)-polynomials of Picard curves from Cartier-Manin matrices
This page was built for publication: Integer multiplication in time \(O(n\log n)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2662018)
