Algorithms for computing greatest common divisors of parametric multivariate polynomials (Q2200294): Difference between revisions

@@ Property / DOI @@
-.1016/j.jsc.2019.10.006
@@ Property / DOI: 10.1016/j.jsc.2019.10.006 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+SINGULAR
@@ Property / describes a project that uses: SINGULAR / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+parametric GCD
@@ Property / describes a project that uses: parametric GCD / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jsc.2019.10.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2980922731
@@ Property / OpenAlex ID: W2980922731 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234189
@@ Property / cites work: Q4234189 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3590274
@@ Property / cites work: Q3590274 / rank @@
+Normal rank
@@ Property / cites work @@
+What can be computed in algebraic geometry?
@@ Property / cites work: What can be computed in algebraic geometry? / rank @@
+Normal rank
@@ Property / cites work @@
+On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
+Normal rank
@@ Property / cites work @@
+Q4023642
@@ Property / cites work: Q4023642 / rank @@
+Normal rank
@@ Property / cites work @@
+Using Algebraic Geometry
@@ Property / cites work: Using Algebraic Geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Computing in algebraic geometry. A quick start using SINGULAR
+Normal rank
@@ Property / cites work @@
+The Structure of Polynomial Ideals and Gröbner Bases
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
+Normal rank
@@ Property / cites work @@
+A new algorithm for computing comprehensive Gröbner systems
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system
+Normal rank
@@ Property / cites work @@
+The complexity of the word problems for commutative semigroups and polynomial ideals
+Normal rank
@@ Property / cites work @@
+Q3678669
@@ Property / cites work: Q3678669 / rank @@
+Normal rank
@@ Property / cites work @@
+A new algorithm for discussing Gröbner bases with parameters.
+Normal rank
@@ Property / cites work @@
+On the computation of parametric Gröbner bases for modules and syzygies
+Normal rank
@@ Property / cites work @@
+Stability Conditions of Monomial Bases and Comprehensive Gröbner Systems
+Normal rank
@@ Property / cites work @@
+Parametric Greatest Common Divisors using Comprehensive Gröbner Systems
+Normal rank
@@ Property / cites work @@
+Three new algorithms for multivariate polynomial GCD
+Normal rank
@@ Property / cites work @@
+A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
+Normal rank
@@ Property / cites work @@
+Canonical comprehensive Gröbner bases
@@ Property / cites work: Canonical comprehensive Gröbner bases / rank @@
+Normal rank
@@ Property / cites work @@
+Q3851616
@@ Property / cites work: Q3851616 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JSC.2019.10.006
@@ Property / DOI: 10.1016/J.JSC.2019.10.006 / rank @@
+Normal rank