S. D. Cohen, `Polynomial factorization and the construction of regular directed graphs with small diameter" Preprint, 1995. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Open Problems And Conjectures In Finite Fields - Mullen, Shparlinski (1996) (1 citation) (Correct)
.... squarefree while Cohen [16] considered the case when f is tame (the characteristic p of F q does not divide the multiplicity of the roots of f ) The case when p = 2 is particularly sketchy in [16] but the general result for f satisfying a weaker condition than tame is presented in detail in [17]. See also Shparlinski [79] who uses new bounds on exponential sums over finite fields to generalize Chung s construction and estimate the parameters of the corresponding graphs. We close this section by giving two problems stated in Chung [11] although similar problems could of course be stated ....
S. D. Cohen, `Polynomial factorization and the construction of regular directed graphs with small diameter" Preprint, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC