Fast computation of special resultants

Authors:
Alin Bostan;Philippe Flajolet;Bruno Salvy;Éric Schost
Affiliations:
Algorithms Project, Inria Rocquencourt, 78153 Le Chesnay, France;Algorithms Project, Inria Rocquencourt, 78153 Le Chesnay, France;Algorithms Project, Inria Rocquencourt, 78153 Le Chesnay, France;LIX, École polytechnique, 91128 Palaiseau, France
Venue:
Journal of Symbolic Computation
Year:
2006

Citing 38
Cited 11

Irreducibles and the composed product for polynomials over a finite field

Discrete Mathematics
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
On fast multiplication of polynomials over arbitrary algebras

Acta Informatica
Hypergeometric solutions of linear recurrences with polynomial coefficients

Journal of Symbolic Computation - Special issue on symbolic computation in combinatorics
Fast construction of irreducible polynomials over finite fields

Journal of Symbolic Computation
Fast polynomial dispersion computation and its application to indefinite summation

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Symmetric functions, m-sets, and Galois groups

Mathematics of Computation
Finding roots of unity among quotients of the roots of an integral polynomial

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Implicitization of parametric curves and surfaces by using symmetric functions

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
A new polynomial factorization algorithm and its implementation

Journal of Symbolic Computation
Greatest factorial factorization and symbolic summation

Journal of Symbolic Computation
Parallel computation of polynomial GCD and some related parallel computations over abstract fields

Theoretical Computer Science
Faster solution of the key equation for decoding BCH error-correcting codes

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Fast algorithms for Taylor shifts and certain difference equations

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Asymptotically fast computation of subresultants

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Subquadratic-time factoring of polynomials over finite fields

Mathematics of Computation
Fast rectangular matrix multiplication and applications

Journal of Complexity
Modern computer algebra

Modern computer algebra
Efficient computation of minimal polynomials in algebraic extensions of finite fields

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Fast Algorithms for Manipulating Formal Power Series

Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities

Journal of the ACM (JACM)
Challenges of symbolic computation: my favorite open problems

Journal of Symbolic Computation
Sylvester—Habicht sequences and fast Cauchy index computation

Journal of Symbolic Computation
Basic analytic combinatorics of directed lattice paths

Theoretical Computer Science
Newton Symmetric Functions and the Arithmetic of Algebraically Closed Fields

AAECC-5 Proceedings of the 5th International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Improving the Time Complexity of the Computation of Irreducible and Primitive Polynomials in Finite Fields

AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Using Symmetric Functions to Describe the Solution Set of a Zero Dimensional Ideal

AAECC-11 Proceedings of the 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Fast Parallel Computation of Characteristic Polynomials by Leverrier's POwer Sum Method Adapted to Fields of Finite Characteristic

ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Algebraic Transformations of Polynomial Equations, Symmetric Polynomials and Elimination

ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
Fonctions symétriques et changements de bases

EUROCAL '87 Proceedings of the European Conference on Computer Algebra
Note for computing the minimum polynomied of elements in large finite fields

Proceedings of the 3rd International Colloquium on Coding Theory and Applications
Counting Points on Hyperelliptic Curves over Finite Fields

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Algebraic factoring and rational function integration

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Tellegen's principle into practice

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Shiftless decomposition and polynomial-time rational summation

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
The Middle Product Algorithm I

Applicable Algebra in Engineering, Communication and Computing
Multivariate power series multiplication

Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Processor-efficient parallel solution of linear systems. II. The positive characteristic and singular cases

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science

High-performance implementations of the Descartes method

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Change of order for bivariate triangular sets

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Lifting and recombination techniques for absolute factorization

Journal of Complexity
Fast computation of power series solutions of systems of differential equations

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Fast polynomial factorization and modular composition in small characteristic

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Homotopy techniques for multiplication modulo triangular sets

Journal of Symbolic Computation
Genus 2 point counting over prime fields

Journal of Symbolic Computation
On the complexity of computing with zero-dimensional triangular sets

Journal of Symbolic Computation
Inversion modulo zero-dimensional regular chains

CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
Algorithms for the universal decomposition algebra

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Modular Composition Modulo Triangular Sets and Applications

Computational Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multivariate resultants, that we compute using power sums of roots of polynomials, by means of their generating series.