Paper Info
Title
Computation of the Minimal Associated Primes
Abstract
We propose a new algorithm for the computation of the mini- mal associated primes of an ideal. In (1) we have introduced modifications to an algorithm for the computation of the radical by Krick and Logar ((2)) (based on ideas by Gianni, Trager and Zacharias ((3))), that made it more ecient. In this work, we show how these same modifications can be applied to the algorithm for the computation of the minimal associ- ated primes proposed in (3). We explain the algorithm, our modifications and show some benchmarks that confirm that the new algorithm is more ecient than the original one.
Year
Venue
Keywords
2006
Challenges in Symbolic Computation Software
primary decomposition,polynomial ideal,. minimal associated primes,radical,grobner bases
Field
DocType
Citations 
Integer,Discrete mathematics,Polynomial,Algebra,System of polynomial equations,Symbolic computation,Mathematics,Computation
Conference
2
PageRank 
References 
Authors
0.51
4
1
Name
Order
Citations
PageRank
Santiago Laplagne1132.84