Modular composition via factorization
type: Item
instance of: scholarly article
title: Modular composition via factorization
zbMATH Open document ID: 1430.12003
author: Joris van der Hoeven
author: Grégoire Lecerf
published in: Journal of Complexity
publication date: 2018-07-27T00:00:00Z
Mathematics Subject Classification ID: 12-08
Mathematics Subject Classification ID: 11T06
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 12E05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6911385
zbMATH Keywords: Modular composition
zbMATH Keywords: finite field
zbMATH Keywords: factorization
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: j.jco.2018.05.002
OpenAlex ID: W2785230309
cites work: Composing power series over a finite ring in essentially linear time
cites work: Fast computation of special resultants
cites work: Q4660643
cites work: Irreducibles and the composed product for polynomials over a finite field
cites work: Fast Algorithms for Manipulating Formal Power Series
cites work: Q4331740
cites work: On fast multiplication of polynomials over arbitrary algebras
cites work: On irreducible polynomials of certain types in finite fields
cites work: Fast construction of irreducible polynomials over finite fields
cites work: Fast arithmetics in Artin-Schreier towers over finite fields
cites work: Q3251484
cites work: Taking roots over high extensions of finite fields
cites work: Deterministic root finding over finite fields using Graeffe transforms
cites work: Q3518705
cites work: Faster Polynomial Multiplication over Finite Fields
cites work: Fast rectangular matrix multiplication and applications
cites work: A fast algorithm for reversion of power series
cites work: Q4226960
cites work: Subquadratic-time factoring of polynomials over finite fields
cites work: Fast Polynomial Factorization and Modular Composition
cites work: Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.
cites work: Recurrent methods for constructing irreducible polynomials over \(\mathbb F_q\) of odd characteristics. II
cites work: On p-Adic Differential Equations with Separation of Variables
cites work: Powers of tensors and fast matrix multiplication
cites work: Handbook of finite fields
cites work: Q4298260
cites work: On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
cites work: Probabilistic Algorithms in Finite Fields
cites work: On the number of positive integers less than 𝑥 and free of prime divisors greater than 𝑥^{𝑐}
cites work: A fast numerical algorithm for the composition of power series with complex coefficients
cites work: Relax, but don't be too lazy
cites work: Composition Modulo Powers of Polynomials
cites work: Modern computer algebra
cites work: Boolean circuits versus arithmetic circuits
cites work: Computing Frobenius maps and factoring polynomials
Wikidata QID: Q129854256
DOI: 10.1016/J.JCO.2018.05.002
description: scientific article; zbMATH DE number 6911385