An algorithm for primary decomposition in polynomial rings over the integers (Q657376)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for primary decomposition in polynomial rings over the integers |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for primary decomposition in polynomial rings over the integers |
scientific article |
Statements
An algorithm for primary decomposition in polynomial rings over the integers (English)
0 references
16 January 2012
0 references
A new algorithm for primary decomposition in polynomial rings over the integers is presented. It makes essential use of primary decomposition over the rationals and over finite fields. Other algorithms can be found in [\textit{A. Seidenberg}, Am. J. Math. 100, 685--706 (1978; Zbl 0416.13013)], [\textit{P. Gianni}, \textit{B. Trager}, and \textit{G. Zacharias}, J. Symb. Comp. 6, No. 2--3, 149--167 (1988; Zbl 0667.13008)], and [\textit{C. W. Ayoub}, J. Algebra 76, 99--110 (1982; Zbl 0505.13005)].
0 references
Gröbner bases
0 references
primary decomposition
0 references
modular computation
0 references
parallel computation
0 references
0.8661892414093018
0 references
0.8642174005508423
0 references
0.8632960915565491
0 references
0.861998975276947
0 references
