Faster modular composition
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4048300 (Why is no real title available?)
- scientific article; zbMATH DE number 3711281 (Why is no real title available?)
- scientific article; zbMATH DE number 3711820 (Why is no real title available?)
- scientific article; zbMATH DE number 177858 (Why is no real title available?)
- scientific article; zbMATH DE number 3639148 (Why is no real title available?)
- scientific article; zbMATH DE number 1253982 (Why is no real title available?)
- scientific article; zbMATH DE number 1253989 (Why is no real title available?)
- scientific article; zbMATH DE number 1263378 (Why is no real title available?)
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 2151179 (Why is no real title available?)
- scientific article; zbMATH DE number 2151192 (Why is no real title available?)
- scientific article; zbMATH DE number 5485560 (Why is no real title available?)
- scientific article; zbMATH DE number 3401090 (Why is no real title available?)
- scientific article; zbMATH DE number 7788370 (Why is no real title available?)
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- A fast numerical algorithm for the composition of power series with complex coefficients
- A general module theoretic framework for vector M-Padé and matrix rational interpolation
- A generalized Vandermonde determinant
- A new polynomial factorization algorithm and its implementation
- Accelerated tower arithmetic
- Algorithms – ESA 2004
- Amortized bivariate multi-point evaluation
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Composing power series over a finite ring in essentially linear time
- Composition modulo powers of polynomials
- Computing Frobenius maps and factoring polynomials
- Computing minimal nullspace bases
- Directed evaluation
- Efficient algorithms for order basis computation
- Fast Algorithms for Manipulating Formal Power Series
- Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
- Fast amortized multi-point evaluation
- Fast computation of approximant bases in canonical form
- Fast computation of generic bivariate resultants
- Fast computation of power series solutions of systems of differential equations
- Fast computation of special resultants
- Fast construction of irreducible polynomials over finite fields
- Fast multivariate multipoint evaluation over all finite fields
- Fast polynomial factorization and modular composition
- Fast rectangular matrix multiplication and applications
- Fast separable factorization and applications
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Fast, algebraic multivariate multipoint evaluation in small characteristic and applications
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
- Faster inversion and other black box matrix computations using efficient block projections
- Faster matrix multiplication via asymmetric hashing
- Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation
- Ideal basis and primary decompositions: case of two variables
- Improved rectangular matrix multiplication using powers of the Coppersmith-Winograd tensor
- Linear multivariable systems
- Modern computer algebra
- Modular composition modulo triangular sets and applications
- Modular composition via factorization
- New bounds for matrix multiplication: from alpha to omega
- On computing the resultant of generic bivariate polynomials
- On lattice reduction for polynomial matrices
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- On the complexity of computing determinants
- On the complexity of computing with zero-dimensional triangular sets
- On the matrix Berlekamp-Massey algorithm
- Power series composition and change of basis
- Relax, but don't be too lazy
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
- Solving sparse linear equations over finite fields
- Square-free algorithms in positive characteristic
- Sub-quadratic time for riemann-roch spaces
- Subquadratic-time algorithms for normal bases
- Subquadratic-time factoring of polynomials over finite fields
This page was built for publication: Faster modular composition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7031250)
