Counting zeros of polynomials over finite fields

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...

Full description

Bibliographic Details
Main Author: Erickson, Daniel Edwin
Format: Others
Published: 1974
Online Access:https://thesis.library.caltech.edu/4061/1/Erickson_de_1974.pdf
Erickson, Daniel Edwin (1974) Counting zeros of polynomials over finite fields. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/Q28M-M322. https://resolver.caltech.edu/CaltechETD:etd-10132005-082129 <https://resolver.caltech.edu/CaltechETD:etd-10132005-082129>

Internet

https://thesis.library.caltech.edu/4061/1/Erickson_de_1974.pdf
Erickson, Daniel Edwin (1974) Counting zeros of polynomials over finite fields. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/Q28M-M322. https://resolver.caltech.edu/CaltechETD:etd-10132005-082129 <https://resolver.caltech.edu/CaltechETD:etd-10132005-082129>

Similar Items