The computation of polynomial greatest common divisors over an algebraic number field (Q582076): Difference between revisions

@@ Property / cites work @@
+Cylindrical Algebraic Decomposition I: The Basic Algorithm
+Normal rank
@@ Property / cites work @@
+On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
+Normal rank
@@ Property / cites work @@
+On Euclid's Algorithm and the Theory of Subresultants
+Normal rank
@@ Property / cites work @@
+Q4079605
@@ Property / cites work: Q4079605 / rank @@
+Normal rank
@@ Property / cites work @@
+Factoring Polynomials over Algebraic Number Fields
+Normal rank
@@ Property / cites work @@
+Q3326837
@@ Property / cites work: Q3326837 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3698903
@@ Property / cites work: Q3698903 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3697106
@@ Property / cites work: Q3697106 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4391223
@@ Property / cites work: Q4391223 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3963114
@@ Property / cites work: Q3963114 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate formulas for some functions of prime numbers
+Normal rank
@@ Property / cites work @@
+Factoring Polynomials Over Algebraic Number Fields
+Normal rank