MOP 2007 Black


It is often a good idea to look at the coefficients of the polynomial from a number theoretical standpoint. The general principle is that any polynomial equation can be reduced mod m to obtain another polynomial equation whose coefficients are the residue classes mod m. Many criterions exist for testing whether a polynomial is irreducible. Unfortunately, none are powerful enough to be universal. One of the most well-known criteria is Eisenstein’s criterion.

Cite this paper

@inproceedings{Zhao2007MOP2B, title={MOP 2007 Black}, author={Yufei Zhao}, year={2007} }