Faster multi-point evaluation over any field
From MaRDI portal
Cites work
- Algorithme de Brill-Noether et codes de Goppa
- Amortized bivariate multi-point evaluation
- Amortized multi-point evaluation of multivariate polynomials
- Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities
- Elements of provable high orders in finite fields
- Fast amortized multi-point evaluation
- Fast computation of shifted Popov forms of polynomial matrices via systems of modular polynomial equations
- Fast multipoint evaluation of bivariate polynomials
- Fast multivariate multi-point evaluation revisited
- Fast multivariate multipoint evaluation over all finite fields
- Fast polynomial factorization and modular composition
- Fast reduction of bivariate polynomials with respect to sufficiently regular Gröbner bases
- Fast, algebraic multivariate multipoint evaluation in small characteristic and applications
- Faster modular composition
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 2151179 (Why is no real title available?)
- Modern computer algebra
- Multi-point evaluation in higher dimensions
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- New bounds for matrix multiplication: from alpha to omega
- On fast multiplication of polynomials over arbitrary algebras
- On finding primitive roots in finite fields
- On the complexity exponent of polynomial system solving
- On the construction of finite field elements of large order
- Searching for Primitive Roots in Finite Fields
This page was built for publication: Faster multi-point evaluation over any field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443519)