An algorithm for the computation of the radical of an ideal
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...
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | CONF |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_15959327_v2006_n_p191_Laplagne |
| Aporte de: |
| id |
todo:paper_15959327_v2006_n_p191_Laplagne |
|---|---|
| record_format |
dspace |
| spelling |
todo:paper_15959327_v2006_n_p191_Laplagne2023-10-03T16:27:41Z An algorithm for the computation of the radical of an ideal Laplagne, S. Algorithms Complexity Polynomial ideal Primary decomposition Radical Computational complexity Computational methods Polynomial approximation Problem solving Polynomial ideal Primary decomposition Radical Algorithms 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. Copyright 2006 ACM. Fil:Laplagne, S. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. CONF info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_15959327_v2006_n_p191_Laplagne |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-134 |
| collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
| topic |
Algorithms Complexity Polynomial ideal Primary decomposition Radical Computational complexity Computational methods Polynomial approximation Problem solving Polynomial ideal Primary decomposition Radical Algorithms |
| spellingShingle |
Algorithms Complexity Polynomial ideal Primary decomposition Radical Computational complexity Computational methods Polynomial approximation Problem solving Polynomial ideal Primary decomposition Radical Algorithms Laplagne, S. An algorithm for the computation of the radical of an ideal |
| topic_facet |
Algorithms Complexity Polynomial ideal Primary decomposition Radical Computational complexity Computational methods Polynomial approximation Problem solving Polynomial ideal Primary decomposition Radical Algorithms |
| description |
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. Copyright 2006 ACM. |
| format |
CONF |
| author |
Laplagne, S. |
| author_facet |
Laplagne, S. |
| author_sort |
Laplagne, S. |
| title |
An algorithm for the computation of the radical of an ideal |
| title_short |
An algorithm for the computation of the radical of an ideal |
| title_full |
An algorithm for the computation of the radical of an ideal |
| title_fullStr |
An algorithm for the computation of the radical of an ideal |
| title_full_unstemmed |
An algorithm for the computation of the radical of an ideal |
| title_sort |
algorithm for the computation of the radical of an ideal |
| url |
http://hdl.handle.net/20.500.12110/paper_15959327_v2006_n_p191_Laplagne |
| work_keys_str_mv |
AT laplagnes analgorithmforthecomputationoftheradicalofanideal AT laplagnes algorithmforthecomputationoftheradicalofanideal |
| _version_ |
1782028880350019584 |