A quick and dirty irreducibility Test for Multivariate Polynomials over F_q
代数几何
2007-05-23 v1
摘要
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.
引用
@article{arxiv.math/0404342,
title = {A quick and dirty irreducibility Test for Multivariate Polynomials over F_q},
author = {H. -C. Graf v. Bothmer and F. -O. Schreyer},
journal= {arXiv preprint arXiv:math/0404342},
year = {2007}
}
备注
11 pages, 4 figures; AMSlatex