Pages that link to "Item:Q4170245"
From MaRDI portal
The following pages link to Fast Algorithms for Manipulating Formal Power Series (Q4170245):
Displaying 50 items.
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- Local behavior near quasi-periodic solutions of conformally symplectic systems (Q376308) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- Genus 2 point counting over prime fields (Q412199) (← links)
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
- Algebraic computation of resolvents without extraneous powers (Q444389) (← links)
- Algorithms for combinatorial structures: well-founded systems and Newton iterations (Q444909) (← links)
- Relaxed algorithms for \(p\)-adic numbers (Q449711) (← links)
- On the efficient computation of high-order derivatives for implicitly defined functions (Q615133) (← links)
- Efficient and accurate computation of upper bounds of approximation errors (Q633637) (← links)
- Computing with D-algebraic power series (Q669617) (← links)
- Modular composition via factorization (Q722764) (← links)
- Functional decomposition of polynomials: the tame case (Q753496) (← links)
- The area-time complexity of the greatest common divisor problem: A lower bound (Q910227) (← links)
- Newton's method and FFT trading (Q979146) (← links)
- A simple and fast algorithm for computing exponentials of power series (Q989478) (← links)
- Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem (Q990817) (← links)
- Truncation and manipulation of multivariate power series (Q1092588) (← links)
- On expansion of algebraic functions in power and Puiseux series. I (Q1094132) (← links)
- A fast numerical algorithm for the composition of power series with complex coefficients (Q1095657) (← links)
- A systolic algorithm for extended GCD computation (Q1110555) (← links)
- Differentiably finite power series (Q1145145) (← links)
- Tight bounds on the complexity index of one-point iterations (Q1145499) (← links)
- Optimal radius of convergence of interpolatory iterations for operator equations (Q1146501) (← links)
- Convergence and complexity of interpolatory-Newton iteration in a Banach space (Q1146502) (← links)
- On the representation of multi-input systems: Computational properties of polynomial algorithms (Q1154808) (← links)
- Fast rectangular matrix multiplication and applications (Q1271174) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Convolution number (Q1324667) (← links)
- Generating power of lazy semantics (Q1389632) (← links)
- Algorithms for exponentiation in finite fields (Q1581128) (← links)
- Predicting zero coefficients in formal power series computations. (Q1599549) (← links)
- Fast operations on linearized polynomials and their applications in coding theory (Q1635282) (← links)
- Ulrich complexity (Q1679674) (← links)
- Detection of the singularities of a complex function by numerical approximations of its Laurent coefficients (Q1744034) (← links)
- Algorithms for sequential generation of combinatorial structures (Q1822996) (← links)
- Laplace's method on a computer algebra system with an application to the real valued modified Bessel functions (Q1860383) (← links)
- Relax, but don't be too lazy (Q1866999) (← links)
- An application of algebraic geometry to encryption: tame transformation method (Q1884054) (← links)
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields (Q1994892) (← links)
- From implicit to recursive equations (Q2002150) (← links)
- Subquadratic-time algorithms for normal bases (Q2040602) (← links)
- Computing newforms using supersingular isogeny graphs (Q2100578) (← links)
- On existence and uniqueness of formal power series solutions of algebraic ordinary differential equations (Q2113584) (← links)
- Computing in degree \(2^k\)-extensions of finite fields of odd characteristic (Q2260788) (← links)
- Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
- Accelerated tower arithmetic (Q2338646) (← links)
- Rigorous high-precision computation of the Hurwitz zeta function and its derivatives (Q2351480) (← links)
- Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
