Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2 (Q4235525): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4888749
@@ Property / cites work: Q4888749 / rank @@
+Normal rank
@@ Property / cites work @@
+On arithmetical algorithms over finite fields
@@ Property / cites work: On arithmetical algorithms over finite fields / rank @@
+Normal rank
@@ Property / cites work @@
+Q4718158
@@ Property / cites work: Q4718158 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4227316
@@ Property / cites work: Q4227316 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023676
@@ Property / cites work: Q4023676 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234290
@@ Property / cites work: Q4234290 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4314373
@@ Property / cites work: Q4314373 / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial factorization algorithm and its implementation
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of Continued Fractions
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4235525