Ideal basis and primary decompositions: case of two variables (Q1821556): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 05:47, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Ideal basis and primary decompositions: case of two variables |
scientific article |
Statements
Ideal basis and primary decompositions: case of two variables (English)
0 references
1985
0 references
Gröbner bases provide a universal technique for computer-algebraic treatment of algebraic and geometric problems. However, the question of structural complexity of Gröbner bases and that of the computational complexity of the relevant algorithms remain as yet practically open. The present paper contains a complete and constructive description of Gröbner bases for the class of two-variable polynomials over a field and that of univariate polynomials over a Euclidean ring. This description gives rise to a simple algorithm for computing primary decompositions. A natural factorization is also found for the resultant of two univariate polynomials.
0 references
Gröbner bases
0 references
structural complexity
0 references
computational complexity
0 references
two- variable polynomials over a field
0 references
univariate polynomials over a Euclidean ring
0 references
algorithm for computing primary decompositions
0 references
factorization
0 references