Fast multivariate multi-point evaluation revisited
From MaRDI portal
Publication:2283121
Recommendations
Cites work
- scientific article; zbMATH DE number 1253982 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 641702 (Why is no real title available?)
- scientific article; zbMATH DE number 2151179 (Why is no real title available?)
- A Gröbner free alternative for polynomial system solving
- A fast algorithm for reversion of power series
- A fast numerical algorithm for the composition of power series with complex coefficients
- Algorithms – ESA 2004
- Approximate formulas for some functions of prime numbers
- Composing power series over a finite ring in essentially linear time
- Composition modulo powers of polynomials
- Efficient \(p\)th root computations in finite fields of characteristic \(p\)
- Even faster integer multiplication
- Fast Algorithms for Manipulating Formal Power Series
- Fast Multiple-Precision Evaluation of Elementary Functions
- Fast computation of continued fraction expansions.
- Fast polynomial factorization and modular composition
- Fast rectangular matrix multiplication and applications
- Faster deterministic integer factorization
- Faster integer multiplication using plain vanilla FFT primes
- Faster integer multiplication using short lattice vectors
- Faster polynomial multiplication over finite fields
- Faster sparse multivariate polynomial interpolation of straight-line programs
- Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
- Modern computer algebra
- Modular composition via factorization
- Multi-point evaluation in higher dimensions
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- On fast multiplication of polynomials over arbitrary algebras
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- On the bit-complexity of sparse polynomial and series multiplication
- On the complexity of the Lickteig-Roy subresultant algorithm
- Polynomial evaluation and interpolation on special sets of points
- Relax, but don't be too lazy
- Searching for Primitive Roots in Finite Fields
- The truncated fourier transform and applications
Cited in
(23)- Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
- Fast polynomial factorization and modular composition
- Fast Enumeration Algorithm for Multivariate Polynomials over General Finite Fields
- Elimination ideal and bivariate resultant over finite fields
- Bivariate polynomial reduction and elimination ideal over finite fields
- Algorithms – ESA 2004
- Fast, algebraic multivariate multipoint evaluation in small characteristic and applications
- Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
- Composition modulo powers of polynomials
- Modular composition via factorization
- Amortized multi-point evaluation of multivariate polynomials
- Directed evaluation
- Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities
- A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density
- Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology
- Multi-point evaluation in higher dimensions
- On the complexity exponent of polynomial system solving
- Sparse tensors and subdivision methods for finding the zero set of polynomial equations
- Fast amortized multi-point evaluation
- Univariate polynomial factorization over finite fields with large extension degree
- Amortized bivariate multi-point evaluation
- Fast computation of generic bivariate resultants
- On Isolating Roots in a Multiple Field Extension
This page was built for publication: Fast multivariate multi-point evaluation revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2283121)
