Counting zeros of polynomials over finite fields
NOTE: Text or symbols not renderable in plain ASCII are indicated by [...]. Abstract is included in .pdf document. The main results of this dissertation are described in the following theorem: Theorem 5.1 If P is a polynomial of degree r = s(q-1) + t, with 0 < t <= q - 1, in m variabl...
Similar Items
-
On permutation polynomials over finite fields
by: R. A. Mollin, et al.
Published: (1987-01-01) -
Random polynomials over finite fields
by: Sharkey, Andrew
Published: (1999) -
Complexity issues in counting, polynomial evaluation and zero finding
by: Briquel, Irénée
Published: (2011) -
Complexity issues in counting, polynomial evaluation and zero finding
by: Briquel, Irénée
Published: (2011) -
Factorization Algorithms for Polynomials over Finite Fields
by: Hanif, Sajid, et al.
Published: (2011)