scientific article; zbMATH DE number 2151179
From MaRDI portal
Publication:4660643
Recommendations
Cited in
(46)- Deformation techniques for sparse systems
- Fast conversion algorithms for orthogonal polynomials
- A probabilistic algorithm for verifying polynomial middle product in linear time
- Multilinear polynomial systems: root isolation and bit complexity
- Fast computation of generic bivariate resultants
- Amortized multi-point evaluation of multivariate polynomials
- Fast amortized multi-point evaluation
- Fast multivariate multi-point evaluation revisited
- Fast Hermite interpolation and evaluation over finite fields of characteristic two
- Accelerated tower arithmetic
- Lifting and recombination techniques for absolute factorization
- A fast Hermite transform
- Polynomial evaluation and interpolation on special sets of points
- Fast computation of special resultants
- Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications
- Tellegen's principle, non-minimal realization of systems and inversion of polynomial Vandermonde matrices
- Faster algorithms for the square root and reciprocal of power series
- Irregular primes to 163 million
- Code Generation for Polynomial Multiplication
- Modular composition modulo triangular sets and applications
- The Karatsuba integer middle product
- Fast arithmetics in Artin-Schreier towers over finite fields
- A simple and fast online power series multiplication and its analysis
- transalpyne: a language for automatic transposition
- On matrices with displacement structure: generalized operators and faster algorithms
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
- Fast convolutions meet Montgomery
- Elimination ideal and bivariate resultant over finite fields
- 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
- Fast private set intersection from polynomial multiplication triples
- Towards automated generation of fast and accurate algorithms for recursive matrix multiplication
- Sparse polynomial interpolation: faster strategies over finite fields
- Factoring sparse polynomials fast
- Faster modular composition
- Strassen's algorithm is not optimally accurate
- In-place fast polynomial modular remainder
- On the complexities of multipoint evaluation and interpolation
- Modular composition via factorization
- Towards a library for straight-line programs
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Solving structured linear systems with large displacement rank
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4660643)
