Fast modular transforms
From MaRDI portal
Publication:1216049
DOI10.1016/S0022-0000(74)80029-2zbMath0302.68064OpenAlexW2010393691MaRDI QIDQ1216049
Publication date: 1974
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(74)80029-2
Related Items
Relative class number of imaginary Abelian fields of prime conductor below 10000, A fast numerical algorithm for the composition of power series with complex coefficients, Few Product Gates But Many Zeros, Solving bivariate systems using rational univariate representations, Polynomial evaluation and interpolation on special sets of points, Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions, Multi-point evaluation in higher dimensions, How to recover a secret with \(O(n)\) additions, Minimal perfect hashing in polynomial time, Deterministic methods to find primes, Separating linear forms and rational univariate representations of bivariate systems, Efficient accelero-summation of holonomic functions, Fast amortized multi-point evaluation, Irregular primes and cyclotomic invariants to 12 million, Fast modular transforms, On the complexities of multipoint evaluation and interpolation, Another polynomial homomorphism, Newton's method and FFT trading, Computational aspects of deciding if all roots of a polynomial lie within the unit circle, A survey of techniques in applied computational complexity, Fast convolutions meet Montgomery, Unconditional class group tabulation of imaginary quadratic fields to $\|\Delta \| < 2^{40}$, Fast Hermite interpolation and evaluation over finite fields of characteristic two, Enclosing Chebyshev Expansions in Linear Time, Nearly optimal computations with structured matrices, VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE, Modular exponentiation via the explicit Chinese remainder theorem, Accelerated tower arithmetic, Amortized multi-point evaluation of multivariate polynomials, On the complexity of skew arithmetic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast method for interpolation using preconditioning
- Fast modular transforms
- Fast multiplication of large numbers
- Fast computation of continued fraction expansions.
- Evaluating polynomials at many points
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
- An algorithm for division of powerseries
- On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives
- Congruence Techniques for the Exact Solution of Integer Systems of Linear Equations
- On the number of multiplications necessary to compute certain functions
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- The Fast Fourier Transform in a Finite Field
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- The Calculation of Multivariate Polynomial Resultants
- Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
