Evaluation properties of invariant polynomials

Authors:
Xavier Dahan;Éric Schost;Jie Wu
Affiliations:
College of Science, Department of Mathematics, Rikkyô University, Tôkyô, Japan;Computer Science Department, The University of Western Ontario, London, Canada;Computer Science Department, The University of Western Ontario, London, Canada and The Graduate University of the Chinese Academy of Sciences, Beijing, China
Venue:
Journal of Symbolic Computation
Year:
2009

Citing 11
Cited 0

On computing the determinant in small parallel time using a small number of processors

Information Processing Letters
Greatest common divisors of polynomials given by straight-line programs

Journal of the ACM (JACM)
On the complexity of computing a Gröbner basis for the radical of a zero dimensional ideal

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Efficient computation of zero-dimensional Gro¨bner bases by change of ordering

Journal of Symbolic Computation
Zeros of equivariant vector fields: algorithms for an invariant approach

Journal of Symbolic Computation
On the stability of Groübner bases under specializations

Journal of Symbolic Computation
Deformation techniques for efficient polynomial equation solving

Journal of Complexity
A Gröbner free alternative for polynomial system solving

Journal of Complexity
Algebraic Solution of Systems of Polynomial Equations Using Groebner Bases

AAECC-5 Proceedings of the 5th International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
When Polynomial Equation Systems Can Be "Solved" Fast?

AAECC-11 Proceedings of the 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers

Journal of Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

A polynomial invariant under the action of a finite group can be rewritten using generators of the invariant ring. We investigate the complexity aspects of this rewriting process; we show that evaluation techniques enable one to reach a polynomial cost.