On the Complexity of the Montes Ideal Factorization Algorithm (Q4931648): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-14518-6_16
+Normal rank
@@ Property / OpenAlex ID @@
+W1517477680
@@ Property / OpenAlex ID: W1517477680 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5550483
@@ Property / cites work: Q5550483 / rank @@
+Normal rank
@@ Property / cites work @@
+Factoring Polynomials Over Large Finite Fields
@@ Property / cites work: Factoring Polynomials Over Large Finite Fields / rank @@
+Normal rank
@@ Property / cites work @@
+On fast multiplication of polynomials over arbitrary algebras
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Factoring Polynomials Over Finite Fields
+Normal rank
@@ Property / cites work @@
+A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
+Normal rank
@@ Property / cites work @@
+Q4248250
@@ Property / cites work: Q4248250 / rank @@
+Normal rank
@@ Property / cites work @@
+Newton polygons of higher order in algebraic number theory
+Normal rank
@@ Property / cites work @@
+Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
+Normal rank
@@ Property / cites work @@
+On a theorem of Ore
@@ Property / cites work: On a theorem of Ore / rank @@
+Normal rank
@@ Property / cites work @@
+Factoring polynomials over local fields.
@@ Property / cites work: Factoring polynomials over local fields. / rank @@
+Normal rank
@@ Property / cites work @@
+Fast multiplication of large numbers
@@ Property / cites work: Fast multiplication of large numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Fast construction of irreducible polynomials over finite fields
+Normal rank
@@ Property / cites work @@
+Q4103629
@@ Property / cites work: Q4103629 / rank @@
+Normal rank