Composition modulo powers of polynomials
From MaRDI portal
Recommendations
Cited in
(17)- A fast numerical algorithm for the composition of power series with complex coefficients
- Computing Riemann-Roch spaces via Puiseux expansions
- Directed evaluation
- Learning read-constant polynomials of constant degree modulo composites
- Fast multivariate multi-point evaluation revisited
- On the complexity exponent of polynomial system solving
- Learning Read-Constant Polynomials of Constant Degree Modulo Composites
- Practical divide-and-conquer algorithms for polynomial arithmetic
- Fast polynomial factorization and modular composition
- Modular composition modulo triangular sets and applications
- Power series composition and change of basis
- Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology
- Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities
- An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases
- Faster modular composition
- Modular composition via factorization
- Fast modular composition using spiroids
This page was built for publication: Composition modulo powers of polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5119973)