33 search results - page 1 / 7 » New Algorithms for Computing Primary Decomposition of Polyno... |
ICMS
2010
13 years 3 months ago
2010
AAECC
2004
Springer
13 years 4 months ago
2004
Springer
Abstract. This article describes two algorithms in order to search decomposition groups of ideals of polynomials with coefficients in a perfect field when those ideals are generate...
ISSAC
2009
Springer
13 years 11 months ago
2009
Springer
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...
AAECC
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel...
ERSHOV
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...