Fast Algorithms for Manipulating Formal Power Series
From MaRDI portal
Cited in
(93)- Fast rectangular matrix multiplication and applications
- Deciphering Singularities by Discrete Methods
- Convergence and complexity of interpolatory-Newton iteration in a Banach space
- Guessing singular dependencies
- Inversion modulo zero-dimensional regular chains
- Computing newforms using supersingular isogeny graphs
- Remarks on the Schoof-Elkies-Atkin algorithm
- Laplace's method on a computer algebra system with an application to the real valued modified Bessel functions
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields
- Predicting zero coefficients in formal power series computations.
- Fast operations on linearized polynomials and their applications in coding theory
- Taking roots over high extensions of finite fields
- Explicit numerical computation of normal forms for Poincaré maps
- Detection of the singularities of a complex function by numerical approximations of its Laurent coefficients
- Accelerated tower arithmetic
- On existence and uniqueness of formal power series solutions of algebraic ordinary differential equations
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- Computational Complexity of One-Step Methods for Systems of Differential Equations
- Modular composition modulo triangular sets and applications
- A systolic algorithm for extended GCD computation
- Rigorous high-precision computation of the Hurwitz zeta function and its derivatives
- Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields
- Genus 2 point counting over prime fields
- Code Generation for Polynomial Multiplication
- Theta nullvalues of supersingular abelian varieties
- On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other
- Efficient Computation of p-Adic Heights
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
- Computing isomorphisms and embeddings of finite fields
- Differentiably finite power series
- Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem
- Computing Frobenius maps and factoring polynomials
- A fast algorithm for reversion of power series
- Algorithms for exponentiation in finite fields
- A simple and fast algorithm for computing exponentials of power series
- Modular composition via factorization
- Breakdown of rotational tori in 2D and 4D conservative and dissipative standard maps
- Algorithms for sequential generation of combinatorial structures
- A public key system with signature and master key functions
- Effective power series computations
- Domains of analyticity and Lindstedt expansions of KAM tori in some dissipative perturbations of Hamiltonian systems
- Division of power series: recursive and non-recursive formulas
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
- Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm
- On the complexity exponent of polynomial system solving
- Algebraic computation of resolvents without extraneous powers
- Algorithms for combinatorial structures: well-founded systems and Newton iterations
- A KAM theory for conformally symplectic systems: efficient algorithms and their validation
- Interval partitions and polynomial factorization
- Relax, but don't be too lazy
- Computation of domains of analyticity of lower dimensional tori in a weakly dissipative Froeschlé map
- Relaxed algorithms for \(p\)-adic numbers
- Faster modular composition
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
- Computing in degree \(2^k\)-extensions of finite fields of odd characteristic
- Bivariate polynomial reduction and elimination ideal over finite fields
- Computing functions on Jacobians and their quotients
- On the representation of multi-input systems: Computational properties of polynomial algorithms
- On the efficient computation of high-order derivatives for implicitly defined functions
- A probabilistic algorithm to test local algebraic observability in polynomial time
- Subquadratic-time algorithms for normal bases
- Newton's method and FFT trading
- Convolution number
- Threshold Niederreiter: chosen-ciphertext security and improved distributed decoding
- Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic
- Polynomial decomposition algorithms
- Efficient and accurate computation of upper bounds of approximation errors
- On the computation of modular forms on noncongruence subgroups
- Generating power of lazy semantics
- The area-time complexity of the greatest common divisor problem: A lower bound
- Ulrich complexity
- Subquadratic-time factoring of polynomials over finite fields
- Newton step methods for AD of an objective defined using implicit functions
- Fast algorithms for computing isogenies between elliptic curves
- On expansion of algebraic functions in power and Puiseux series. I
- Elimination ideal and bivariate resultant over finite fields
- Fast multivariate multi-point evaluation revisited
- Truncation and manipulation of multivariate power series
- On Computing Factors of Cyclotomic Polynomials
- Tight bounds on the complexity index of one-point iterations
- A fast numerical algorithm for the composition of power series with complex coefficients
- A robust numerical path tracking algorithm for polynomial homotopy continuation
- A simple proof of Gevrey estimates for expansions of quasi-periodic orbits: dissipative models and lower-dimensional tori
- An application of algebraic geometry to encryption: tame transformation method
- Fast computation of special resultants
- Local behavior near quasi-periodic solutions of conformally symplectic systems
- Complexity of computation in finite fields
- New algorithms for relaxed multiplication
- Functional decomposition of polynomials: the tame case
- Optimal radius of convergence of interpolatory iterations for operator equations
- Computing with D-algebraic power series
- From implicit to recursive equations
- Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology
This page was built for publication: Fast Algorithms for Manipulating Formal Power Series
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4170245)
