Fast computation of special resultants
From MaRDI portal
Publication:2457312
DOI10.1016/j.jsc.2005.07.001zbMath1121.13037OpenAlexW2153077274MaRDI QIDQ2457312
Alin Bostan, Bruno Salvy, Éric Schost, Philippe Flajolet
Publication date: 23 October 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2005.07.001
Computational aspects and applications of commutative rings (13P99) Acceleration of convergence in numerical analysis (65B99)
Related Items
Lifting and recombination techniques for absolute factorization, Algebraic diagonals and walks: algorithms, bounds, complexity, Deterministic root finding over finite fields using Graeffe transforms, Computing solutions of linear Mahler equations, Inversion Modulo Zero-Dimensional Regular Chains, On the complexity exponent of polynomial system solving, Computing Riemann-Roch spaces via Puiseux expansions, Modular composition modulo triangular sets and applications, Elimination ideal and bivariate resultant over finite fields, Genus 2 point counting over prime fields, High-order lifting for polynomial Sylvester matrices, Formal reduction of singular linear differential systems using eigenrings: a refined approach, Unnamed Item, Unnamed Item, Homotopy techniques for multiplication modulo triangular sets, Fast computation of special resultants, Computing subfields of number fields and applications to Galois group computations, Primality testing with Gaussian periods, The complete generating function for Gessel walks is algebraic, Fast construction of irreducible polynomials over finite fields, Modular composition via factorization, Block-Krylov techniques in the context of sparse-FGLM algorithms, GENERATING FUNCTIONS OF CHEBYSHEV-LIKE POLYNOMIALS, Subquadratic-time algorithms for normal bases, Proof of Chudnovskys' hypergeometric series for \(1/\pi\) using Weber modular polynomials
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring polynomials and the knapsack problem
- Matrix multiplication via arithmetic progressions
- Cauchy index computation
- On fast multiplication of polynomials over arbitrary algebras
- Hypergeometric solutions of linear recurrences with polynomial coefficients
- Fast multiplication of polynomials over fields of characteristic 2
- Fast rectangular matrix multiplication and applications
- Solving zero-dimensional systems through the rational univariate representation
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- Fast algorithms for zero-dimensional polynomial systems using duality
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Coupled Vandermonde matrices and the superfast computation of Toeplitz determinants
- Basic analytic combinatorics of directed lattice paths
- Irreducibles and the composed product for polynomials over a finite field
- The middle product algorithm. I: Speeding up the division and square root of power series
- Greatest factorial factorization and symbolic summation
- A new polynomial factorization algorithm and its implementation
- New techniques for the computation of linear recurrence coefficients
- On computing reciprocals of power series
- Fast computation of special resultants
- Gaussian elimination is not optimal
- Fast multiplication of large numbers
- An algorithm for division of powerseries
- A Generalized Class of Polynomials that are Hard to Factor
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Integer Polynomials that are Reducible Modulo all Primes
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Evaluating Polynomials at Fixed Sets of Points
- Deux propriétés décidables des suites récurrentes linéaires
- Decision procedure for indefinite hypergeometric summation
- Fast Algorithms for Manipulating Formal Power Series
- Implicitization of parametric curves and surfaces by using symmetric functions
- Symmetric Functions, m-Sets, and Galois Groups
- Subquadratic-time factoring of polynomials over finite fields
- Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic
- MULTIVARIATE NEWTON SUMS: IDENTITIES AND GENERATING FUNCTIONS
- Multivariate power series multiplication
- Advances in Cryptology - EUROCRYPT 2004
- Fonctions symétriques et changements de bases
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Fast construction of irreducible polynomials over finite fields
- Sylvester-Habicht sequences and fast Cauchy index computation
