Pages that link to "Item:Q4170245"
From MaRDI portal
The following pages link to Fast Algorithms for Manipulating Formal Power Series (Q4170245):
Displaying 36 items.
- Effective power series computations (Q2420635) (← links)
- Interval partitions and polynomial factorization (Q2429339) (← links)
- Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic (Q2430987) (← links)
- A KAM theory for conformally symplectic systems: efficient algorithms and their validation (Q2435185) (← links)
- Guessing singular dependencies (Q2437325) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- New algorithms for relaxed multiplication (Q2469229) (← links)
- On the complexity exponent of polynomial system solving (Q2658549) (← links)
- Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields (Q2792368) (← links)
- Taking roots over high extensions of finite fields (Q2862538) (← links)
- Inversion Modulo Zero-Dimensional Regular Chains (Q2915000) (← links)
- Computing functions on Jacobians and their quotients (Q2942126) (← links)
- Efficient Computation of <i>p</i>-Adic Heights (Q3091958) (← links)
- On Computing Factors of Cyclotomic Polynomials (Q3137454) (← links)
- Fast algorithms for computing isogenies between elliptic curves (Q3577024) (← links)
- Code Generation for Polynomial Multiplication (Q3644088) (← links)
- Computational Complexity of One-Step Methods for Systems of Differential Equations (Q3875248) (← links)
- A public key system with signature and master key functions (Q4241652) (← links)
- Deciphering Singularities by Discrete Methods (Q4286592) (← links)
- Subquadratic-time factoring of polynomials over finite fields (Q4396457) (← links)
- Remarks on the Schoof-Elkies-Atkin algorithm (Q4396461) (← links)
- Computing isomorphisms and embeddings of finite fields (Q4612574) (← links)
- Newton step methods for AD of an objective defined using implicit functions (Q4685588) (← links)
- Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm (Q4700202) (← links)
- A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation (Q5146689) (← links)
- Domains of analyticity and Lindstedt expansions of KAM tori in some dissipative perturbations of Hamiltonian systems (Q5350520) (← links)
- On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other (Q5439060) (← links)
- A fast algorithm for reversion of power series (Q5497035) (← links)
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring (Q5889792) (← links)
- Polynomial decomposition algorithms (Q5893804) (← links)
- A probabilistic algorithm to test local algebraic observability in polynomial time (Q5894826) (← links)
- A simple proof of Gevrey estimates for expansions of quasi-periodic orbits: dissipative models and lower-dimensional tori (Q6069638) (← links)
- Breakdown of rotational tori in 2D and 4D conservative and dissipative standard maps (Q6111906) (← links)
- Theta nullvalues of supersingular abelian varieties (Q6149154) (← links)
- On the computation of modular forms on noncongruence subgroups (Q6203470) (← links)
- Bivariate polynomial reduction and elimination ideal over finite fields (Q6615408) (← links)
