Fast Algorithms for Manipulating Formal Power Series
From MaRDI portal
Publication:4170245
DOI10.1145/322092.322099zbMath0388.68052OpenAlexW2168527104MaRDI QIDQ4170245
Publication date: 1978
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322092.322099
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Algorithms in computer science (68W99)
Related Items
A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers, Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring, Computing Frobenius maps and factoring polynomials, An application of algebraic geometry to encryption: tame transformation method, Truncation and manipulation of multivariate power series, Fast operations on linearized polynomials and their applications in coding theory, On expansion of algebraic functions in power and Puiseux series. I, A fast numerical algorithm for the composition of power series with complex coefficients, Computational Complexity of One-Step Methods for Systems of Differential Equations, Inversion Modulo Zero-Dimensional Regular Chains, A systolic algorithm for extended GCD computation, On the complexity exponent of polynomial system solving, Modular composition modulo triangular sets and applications, Local behavior near quasi-periodic solutions of conformally symplectic systems, Complexity of computation in finite fields, Computing functions on Jacobians and their quotients, Ulrich complexity, Generating power of lazy semantics, On the efficient computation of high-order derivatives for implicitly defined functions, Domains of analyticity and Lindstedt expansions of KAM tori in some dissipative perturbations of Hamiltonian systems, A simple proof of Gevrey estimates for expansions of quasi-periodic orbits: dissipative models and lower-dimensional tori, Effective power series computations, Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology, Elimination ideal and bivariate resultant over finite fields, Breakdown of rotational tori in 2D and 4D conservative and dissipative standard maps, Genus 2 point counting over prime fields, Differentiably finite power series, Tight bounds on the complexity index of one-point iterations, Optimal radius of convergence of interpolatory iterations for operator equations, Convergence and complexity of interpolatory-Newton iteration in a Banach space, Theta nullvalues of supersingular abelian varieties, Interval partitions and polynomial factorization, Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic, On the computation of modular forms on noncongruence subgroups, Efficient and accurate computation of upper bounds of approximation errors, Complexity bounds for the rational Newton-Puiseux algorithm over finite fields, On the representation of multi-input systems: Computational properties of polynomial algorithms, A KAM theory for conformally symplectic systems: efficient algorithms and their validation, The area-time complexity of the greatest common divisor problem: A lower bound, Guessing singular dependencies, Algebraic computation of resolvents without extraneous powers, Algorithms for combinatorial structures: well-founded systems and Newton iterations, Computing isomorphisms and embeddings of finite fields, Relaxed algorithms for \(p\)-adic numbers, Polynomial decomposition algorithms, Fast computation of special resultants, A probabilistic algorithm to test local algebraic observability in polynomial time, A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation, Computing with D-algebraic power series, On Computing Factors of Cyclotomic Polynomials, Detection of the singularities of a complex function by numerical approximations of its Laurent coefficients, New algorithms for relaxed multiplication, Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields, Deciphering Singularities by Discrete Methods, Fast algorithms for computing isogenies between elliptic curves, From implicit to recursive equations, Subquadratic-time factoring of polynomials over finite fields, Remarks on the Schoof-Elkies-Atkin algorithm, Computing in degree \(2^k\)-extensions of finite fields of odd characteristic, Newton's method and FFT trading, On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other, A simple and fast algorithm for computing exponentials of power series, Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem, Newton step methods for AD of an objective defined using implicit functions, Modular composition via factorization, Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields, Fast multivariate multi-point evaluation revisited, Subquadratic-time algorithms for normal bases, Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm, Functional decomposition of polynomials: the tame case, Efficient Computation of p-Adic Heights, Fast rectangular matrix multiplication and applications, Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)], Code Generation for Polynomial Multiplication, Algorithms for sequential generation of combinatorial structures, A fast algorithm for reversion of power series, Algorithms for exponentiation in finite fields, Accelerated tower arithmetic, Taking roots over high extensions of finite fields, Computing newforms using supersingular isogeny graphs, Predicting zero coefficients in formal power series computations., Laplace's method on a computer algebra system with an application to the real valued modified Bessel functions, Rigorous high-precision computation of the Hurwitz zeta function and its derivatives, A public key system with signature and master key functions, On existence and uniqueness of formal power series solutions of algebraic ordinary differential equations, Relax, but don't be too lazy, Convolution number
