@article{MONICO2002451,
Abstract = {Let K be an infinite perfect computable field and let I⊆K [ x ] be a zero-dimensional ideal represented by a Gr{\"o}bner basis. We derive a new algorithm for computing the reduced primary decomposition of I using only standard linear algebra and univariate polynomial factorization techniques. In practice, the algorithm generally works in finite fields of large characteristic as well.},
Author = {Monico, Chris},
File = {Computing the Primary Decomposition of Zero-Dimensional Ideals - 82813194 - a.pdf},
ISSN = {0747-7171},
Journal = {Journal of Symbolic Computation},
Number = {5},
Pages = {451-459},
Title = {Computing the Primary Decomposition of Zero-dimensional Ideals},
URL = {https://www.sciencedirect.com/science/article/pii/S0747717102905717},
Volume = {34},
Year = {2002},
bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0747717102905717},
bdsk-url-2 = {https://doi.org/10.1006/jsco.2002.0571},
date-added = {2022-11-26 17:04:04 +0100},
date-modified = {2022-11-26 17:04:04 +0100},
doi = {10.1006/jsco.2002.0571}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A