Recommendations
Cites work
- scientific article; zbMATH DE number 3135133 (Why is no real title available?)
- scientific article; zbMATH DE number 1253982 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (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?)
- A fast algorithm for reversion of power series
- A fast numerical algorithm for the composition of power series with complex coefficients
- An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
- Boolean circuits versus arithmetic circuits
- Composing power series over a finite ring in essentially linear time
- Composition modulo powers of polynomials
- Computing Frobenius maps and factoring polynomials
- Deterministic root finding over finite fields using Graeffe transforms
- Fast Algorithms for Manipulating Formal Power Series
- Fast arithmetics in Artin-Schreier towers over finite fields
- Fast computation of special resultants
- Fast construction of irreducible polynomials over finite fields
- Fast construction of irreducible polynomials over finite fields
- Fast polynomial factorization and modular composition
- Fast rectangular matrix multiplication and applications
- Faster polynomial multiplication over finite fields
- Handbook of finite fields
- Irreducibles and the composed product for polynomials over a finite field
- Modern computer algebra
- Modular composition via factorization
- On \(p\)-adic differential equations with separation of variables
- On fast multiplication of polynomials over arbitrary algebras
- On irreducible polynomials of certain types in finite fields
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- On the number of positive integers less than 𝑥 and free of prime divisors greater than 𝑥^{𝑐}
- Powers of tensors and fast matrix multiplication
- Probabilistic Algorithms in Finite Fields
- Recurrent methods for constructing irreducible polynomials over \(\mathbb F_q\) of odd characteristics. II
- Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.
- Relax, but don't be too lazy
- Subquadratic-time factoring of polynomials over finite fields
- Taking roots over high extensions of finite fields
Cited in
(11)- Accelerated tower arithmetic
- Simultaneous modular reduction and Kronecker substitution for small finite fields
- Modular composition modulo triangular sets and applications
- Modular composition via factorization
- On the complexity exponent of polynomial system solving
- Fast polynomial factorization and modular composition
- Composition modulo powers of polynomials
- Fast amortized multi-point evaluation
- Fast multivariate multi-point evaluation revisited
- Directed evaluation
- Univariate polynomial factorization over finite fields with large extension degree
This page was built for publication: Modular composition via factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722764)
