Fast modular composition using spiroids
From MaRDI portal
No records found.
Cites work
- A fast numerical algorithm for the composition of power series with complex coefficients
- Composing power series over a finite ring in essentially linear time
- Composition modulo powers of polynomials
- Even faster integer multiplication
- Fast Algorithms for Manipulating Formal Power Series
- Fast multivariate multi-point evaluation revisited
- Fast multivariate multipoint evaluation over all finite fields
- Fast polynomial factorization and modular composition
- Fast rectangular matrix multiplication and applications
- Fast, algebraic multivariate multipoint evaluation in small characteristic and applications
- Faster modular composition
- scientific article; zbMATH DE number 3856407 (Why is no real title available?)
- scientific article; zbMATH DE number 1253982 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- Title not available (Why is no real title available?)
- Integer multiplication in time \(O(n\log n)\)
- Modern computer algebra
- Modular composition via factorization
- New bounds for matrix multiplication: from alpha to omega
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Specializations in Differential Algebra
- Ultimate complexity for numerical algorithms
- Univariate polynomial factorization over finite fields with large extension degree
This page was built for publication: Fast modular composition using spiroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7325240)
