![Computational number theory / Cryptography / Factorization of polynomials over a finite field and irreducibility tests / Polynomials / Markov decision process / Mathematics / Coding theory / Algebra Computational number theory / Cryptography / Factorization of polynomials over a finite field and irreducibility tests / Polynomials / Markov decision process / Mathematics / Coding theory / Algebra](https://www.pdfsearch.io/img/eb233e352dedce9e5cc62f90313cd8dc.jpg)
| Document Date: 2015-02-14 23:22:02 Open Document File Size: 220,69 KBShare Result on Facebook
City Station / / Currency USD / / / Facility Texas A&M University / TAMU College Station / Mathematics Texas A&M University / / / IndustryTerm continuous applications / online application / / Organization Undergraduate Program Office / Math Department / Texas A&M University / National Science Foundation / / Person Philip B. Yasskin / / / Position Program Director / teacher / / ProvinceOrState Texas / / URL http /
SocialTag |