We provide some statistics about an irreducibility/reducibility test for multivariate polynomials over finite fields based on counting points. The test works best for polynomials in a large number of variables and can also be applied to black-box polynomials.
Publié le : 2005-05-14
Classification:
Irreducibility test,
multivariate polynomials,
black box polynomials,
finite fields,
12E05
@article{1136926972,
author = {Graf von Bothmer, H. -C. and Schreyer, F. -O.},
title = {A Quick and Dirty Irreducibility Test for Multivariate Polynomials over $\Bbb F\_q$},
journal = {Experiment. Math.},
volume = {14},
number = {1},
year = {2005},
pages = { 415-422},
language = {en},
url = {http://dml.mathdoc.fr/item/1136926972}
}
Graf von Bothmer, H. -C.; Schreyer, F. -O. A Quick and Dirty Irreducibility Test for Multivariate Polynomials over $\Bbb F_q$. Experiment. Math., Tome 14 (2005) no. 1, pp. 415-422. http://gdmltest.u-ga.fr/item/1136926972/