scientific article; zbMATH DE number 2151179
From MaRDI portal
Publication:4660643
zbMath1072.68649MaRDI QIDQ4660643
Éric Schost, Grégoire Lecerf, Alin Bostan
Publication date: 4 April 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (33)
Lifting and recombination techniques for absolute factorization ⋮ A fast Hermite transform ⋮ Polynomial evaluation and interpolation on special sets of points ⋮ Modular composition modulo triangular sets and applications ⋮ Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications ⋮ On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms ⋮ Elimination ideal and bivariate resultant over finite fields ⋮ The Karatsuba integer middle product ⋮ Fast arithmetics in Artin-Schreier towers over finite fields ⋮ Fast computation of special resultants ⋮ A simple and fast online power series multiplication and its analysis ⋮ Fast amortized multi-point evaluation ⋮ Solving structured linear systems with large displacement rank ⋮ Multilinear polynomial systems: root isolation and bit complexity ⋮ Fast computation of generic bivariate resultants ⋮ New recombination algorithms for bivariate polynomial factorization based on Hensel lifting ⋮ Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation ⋮ On the complexities of multipoint evaluation and interpolation ⋮ Fast convolutions meet Montgomery ⋮ Modular composition via factorization ⋮ Fast multivariate multi-point evaluation revisited ⋮ Fast Hermite interpolation and evaluation over finite fields of characteristic two ⋮ A probabilistic algorithm for verifying polynomial middle product in linear time ⋮ Bivariate polynomial reduction and elimination ideal over finite fields ⋮ Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities ⋮ Fast interpolation of multivariate polynomials with sparse exponents ⋮ Faster algorithms for the square root and reciprocal of power series ⋮ Irregular primes to 163 million ⋮ Code Generation for Polynomial Multiplication ⋮ Deformation techniques for sparse systems ⋮ Fast conversion algorithms for orthogonal polynomials ⋮ Accelerated tower arithmetic ⋮ Amortized multi-point evaluation of multivariate polynomials
Uses Software
This page was built for publication:
