Evaluation properties of invariant polynomials

DOI10.1016/j.jsc.2008.12.002zbMath1174.13006OpenAlexW1972071236MaRDI QIDQ731933

Éric Schost, Xavier Dahan, Jie Wu

Publication date: 9 October 2009

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2008.12.002

zbMATH Keywords

complexityinvariant polynomialstraight-line programlifting techniques

Mathematics Subject Classification ID

Computational aspects and applications of commutative rings (13P99) Actions of groups on commutative rings; invariant theory (13A50)

Related Items

Unnamed Item

Uses Software

• Kronecker

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
• On computing the determinant in small parallel time using a small number of processors
• Computing combinatorial decompositions of rings
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Zeros of equivariant vector fields: Algorithms for an invariant approach
• Solving a system of algebraic equations with symmetries
• Lower bounds for diophantine approximations
• On the stability of Gröbner bases under specializations
• Straight-line programs in geometric elimination theory
• Computational invariant theory
• Semi-invariants, equivariants and algorithms
• Deformation techniques for efficient polynomial equation solving.
• Greatest common divisors of polynomials given by straight-line programs
• Advances in Cryptology - EUROCRYPT 2004
• EVALUATION PROPERTIES OF SYMMETRIC POLYNOMIALS
• Algorithms in invariant theory
• A Gröbner free alternative for polynomial system solving

This page was built for publication: Evaluation properties of invariant polynomials