Finding roots in with the successive resultants algorithm (Q2878836): Difference between revisions

@@ Property / cites work @@
+Computing Frobenius maps and factoring polynomials
+Normal rank
@@ Property / cites work @@
+Factoring polynomials over finite fields: A survey
+Normal rank
@@ Property / cites work @@
+Fast Polynomial Factorization and Modular Composition
+Normal rank
@@ Property / cites work @@
+A geometric approach to root finding in GT(q/sup m/)
+Normal rank
@@ Property / cites work @@
+Subquadratic-time factoring of polynomials over finite fields
+Normal rank
@@ Property / cites work @@
+Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
+Normal rank
@@ Property / cites work @@
+Fast multiplication of polynomials over fields of characteristic 2
+Normal rank
@@ Property / cites work @@
+Fast computation of continued fraction expansions.
+Normal rank
@@ Property / cites work @@
+Probabilistic Algorithms in Finite Fields
@@ Property / cites work: Probabilistic Algorithms in Finite Fields / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
+Normal rank
@@ Property / cites work @@
+Subgroup Refinement Algorithms for Root Finding in $GF(q)$
+Normal rank
@@ Property / cites work @@
+On the solution of algebraic equations over finite fields
+Normal rank
@@ Property / cites work @@
+Q2949568
@@ Property / cites work: Q2949568 / rank @@
+Normal rank