R. G. Swan, Factorization of polynomials over nite elds, Paci c J. Math. 12 (1962), 1099-1106. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Random Number Generators with Period Divisible by a.. - Richard Brent Computing (2003) (Correct)
No context found.
R. G. Swan, Factorization of polynomials over nite elds, Paci c J. Math. 12 (1962), 1099-1106.
Almost Irreducible and Almost Primitive Trinomials - Brent, Zimmermann (2003) (Correct)
No context found.
R. G. Swan, Factorization of polynomials over nite elds, Paci c J. Mathematics 12 (1962), 1099-1106.
Algorithms for Finding Almost Irreducible and Almost.. - Brent, Zimmermann (2003) (Correct)
No context found.
R. G. Swan, Factorization of polynomials over nite elds, Paci c J. Mathematics 12 (1962), 1099-1106.
A Primitive Trinomial of Degree 6972593 - Brent, Larvala, Zimmermann (2003) (Correct)
No context found.
R. G. Swan, Factorization of polynomials over nite elds, Paci c J. Math. 12 (1962), 1099{ 1106. MR 26#2432.
Random Number Generators with Period Divisible by a Mersenne.. - Brent, Zimmermann (2003) (Correct)
No context found.
R. G. Swan, Factorization of polynomials over nite elds, Paci c J. Mathematics 12 (1962), 1099-1106.
Uniform Random Number Generators and Primitive Trinomials - Brent (2001) (Correct)
No context found.
R. G. Swan, Factorization of polynomials over nite elds, Pacic J. Math. 12 (1962), 1099-1106.
A Fast Algorithm For Testing Irreducibility Of Trinomials.. - Brent, Larvala, Zimmermann (2000) (Correct)
No context found.
R. G. Swan, Factorization of polynomials over nite elds, Pacic J. Math. 12 (1962), 1099-1106. MR 26#2432.
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