Comparison of algorithms for calculation of g.c.d. of polynomials (Q5668674): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207727308920007
+Normal rank
@@ Property / OpenAlex ID @@
+W2020156690
@@ Property / OpenAlex ID: W2020156690 / rank @@
+Normal rank
@@ Property / cites work @@
+Greatest common divisor of two polynomials
@@ Property / cites work: Greatest common divisor of two polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+A New Version of the Euclidean Algorith
@@ Property / cites work: A New Version of the Euclidean Algorith / rank @@
+Normal rank
@@ Property / cites work @@
+A new method for solving polynomial equations
@@ Property / cites work: A new method for solving polynomial equations / rank @@
+Normal rank
@@ Property / cites work @@
+Q5595961
@@ Property / cites work: Q5595961 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5638871
@@ Property / cites work: Q5638871 / rank @@
+Normal rank
@@ Property / cites work @@
+Another Theorem Relating Sylvester's Matrix and the Greatest Common Divisor
+Normal rank
@@ Property / cites work @@
+Q5659396
@@ Property / cites work: Q5659396 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the automatic pretreatment of polynomials
+Normal rank
@@ Property / cites work @@
+Greatest Common Divisor of Several Integers and an Associated Linear Diophantine Equation
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5668674