arXiv · math/0404342
A quick and dirty irreducibility Test for Multivariate Polynomials over F_q
Abstract
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.
Explore related subjects
Keep this discovery
H. -C. Graf v. Bothmer, F. -O. Schreyer. 2004-04-19. A quick and dirty irreducibility Test for Multivariate Polynomials over F_q. https://arxiv.org/abs/math/0404342
Cite the original work for its findings. Save a collection to share your selection of sources.