Algorithms for computing greatest common divisors of parametric multivariate polynomials (Q2200294)
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: Algorithms for computing greatest common divisors of parametric multivariate polynomials |
scientific article; zbMATH DE number 7249894
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for computing greatest common divisors of parametric multivariate polynomials |
scientific article; zbMATH DE number 7249894 |
Statements
Algorithms for computing greatest common divisors of parametric multivariate polynomials (English)
0 references
19 September 2020
0 references
parametric multivariate polynomials
0 references
gcd system
0 references
minimal comprehensive Gröbner system
0 references
ideal intersection
0 references
ideal quotient
0 references
0 references
0 references
0.95694375
0 references
0.9422992
0 references
0.9301797
0 references
0.9294744
0 references
0.9266046
0 references
0 references
0.92376137
0 references
0.91835046
0 references
0.9160631
0 references
