Paper Info
Title
An algorithm for the computation of the radical of an ideal
Abstract
We propose a new algorithm for the computation of the radical of an ideal in a polynomial ring. In recent years many algorithms have been proposed. A common technique used is to reduce the problem to the zero dimensional case. In the algorithm we present here, we use this reduction, but we avoid the redundant components that appeared in other algorithms. As a result, our algorithm is in some cases more efficient.
Year
DOI
Venue
2006
10.1145/1145768.1145802
ISSAC
Keywords
Field
DocType
redundant component,polynomial ring,new algorithm,common technique,zero dimensional case,recent year,radical,algorithms,complexity
Discrete mathematics,Radical of an ideal,Combinatorics,Polynomial ring,Computer science,Primary decomposition,Algorithm,Probabilistic analysis of algorithms,Faugère's F4 and F5 algorithms,Computation
Conference
ISBN
Citations 
PageRank 
1-59593-276-3
10
0.93
References 
Authors
10
1
Name
Order
Citations
PageRank
Santiago Laplagne1132.84