On some approximation problems concerning sparse polynomials over finite fields (Q1351508): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
+Normal rank
@@ Property / cites work @@
+Monte-Carlo approximation algorithms for enumeration problems
+Normal rank
@@ Property / cites work @@
+Q5748889
@@ Property / cites work: Q5748889 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Number of Zeroes of a GF[2] Polynomial
+Normal rank
@@ Property / cites work @@
+The distribution of primitive roots in finite fields
+Normal rank
@@ Property / cites work @@
+New Algorithms for Finding Irreducible Polynomials Over Finite Fields
+Normal rank
@@ Property / cites work @@
+Searching for Primitive Roots in Finite Fields
@@ Property / cites work: Searching for Primitive Roots in Finite Fields / rank @@
+Normal rank
@@ Property / cites work @@
+Fast construction of irreducible polynomials over finite fields
+Normal rank
@@ Property / cites work @@
+Q5750970
@@ Property / cites work: Q5750970 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3137899
@@ Property / cites work: Q3137899 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of sparse polynomial interpolation over finite fields
+Normal rank