The following pages link to Fast modular transforms (Q1216049):
Displaying 29 items.
- On the complexity of skew arithmetic (Q260085) (← links)
- Solving bivariate systems using rational univariate representations (Q325154) (← links)
- Separating linear forms and rational univariate representations of bivariate systems (Q480646) (← links)
- On the complexities of multipoint evaluation and interpolation (Q706626) (← links)
- Minimal perfect hashing in polynomial time (Q911304) (← links)
- Newton's method and FFT trading (Q979146) (← links)
- A fast numerical algorithm for the composition of power series with complex coefficients (Q1095657) (← links)
- Fast modular transforms (Q1216049) (← links)
- Another polynomial homomorphism (Q1219683) (← links)
- Computational aspects of deciding if all roots of a polynomial lie within the unit circle (Q1223130) (← links)
- A survey of techniques in applied computational complexity (Q1224857) (← links)
- Multi-point evaluation in higher dimensions (Q1938507) (← links)
- VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE (Q2056777) (← links)
- Amortized multi-point evaluation of multivariate polynomials (Q2099269) (← links)
- Fast amortized multi-point evaluation (Q2238846) (← links)
- Fast Hermite interpolation and evaluation over finite fields of characteristic two (Q2284960) (← links)
- Accelerated tower arithmetic (Q2338646) (← links)
- Polynomial evaluation and interpolation on special sets of points (Q2387413) (← links)
- Efficient accelero-summation of holonomic functions (Q2457428) (← links)
- Unconditional class group tabulation of imaginary quadratic fields to $\|\Delta \| < 2^{40}$ (Q2796029) (← links)
- Few Product Gates But Many Zeros (Q3182922) (← links)
- Modular exponentiation via the explicit Chinese remainder theorem (Q3420440) (← links)
- Relative class number of imaginary Abelian fields of prime conductor below 10000 (Q4257701) (← links)
- Enclosing Chebyshev Expansions in Linear Time (Q4960945) (← links)
- Deterministic methods to find primes (Q5389455) (← links)
- Fast convolutions meet Montgomery (Q5444325) (← links)
- Nearly optimal computations with structured matrices (Q5919809) (← links)
- Irregular primes and cyclotomic invariants to 12 million (Q5928882) (← links)
- Scalable multiparty computation from non-linear secret sharing (Q6653034) (← links)
