Open Access
Translator Disclaimer
2005 A Quick and Dirty Irreducibility Test for Multivariate Polynomials over $\Bbb F_q$
H. -C. Graf von Bothmer, F. -O. Schreyer
Experiment. Math. 14(4): 415-422 (2005).

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.

Citation

Download Citation

H. -C. Graf von Bothmer. F. -O. Schreyer. "A Quick and Dirty Irreducibility Test for Multivariate Polynomials over $\Bbb F_q$." Experiment. Math. 14 (4) 415 - 422, 2005.

Information

Published: 2005
First available in Project Euclid: 10 January 2006

zbMATH: 1152.12300
MathSciNet: MR2193804

Subjects:
Primary: 12E05

Keywords: black box polynomials , finite fields , Irreducibility test , multivariate polynomials

Rights: Copyright © 2005 A K Peters, Ltd.

JOURNAL ARTICLE
8 PAGES


SHARE
Vol.14 • No. 4 • 2005
Back to Top