A Quick and Dirty Irreducibility Test for Multivariate Polynomials over 𝔽q

DOI10.1080/10586458.2005.10128933zbMath1152.12300arXivmath/0404342OpenAlexW2094441390MaRDI QIDQ3378972

Hans-Christian Graf von Bothmer, Frank-Olaf Schreyer

Publication date: 6 April 2006

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0404342

zbMATH Keywords

finite fieldsmultivariate polynomialsblack box polynomialsIrreducibility test

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials over finite fields (11T06)

Related Items (3)

Focal values of plane cubic centers ⋮ Finding points on varieties with Macaulay2 ⋮ A Version of Green’s Conjecture in Positive Characteristic

Uses Software

• Macaulay2

This page was built for publication: A Quick and Dirty Irreducibility Test for Multivariate Polynomials over 𝔽_q