A quick and dirty irreducibility Test for Multivariate Polynomials over F_q

Simple item page
dc.creatorBothmer, H. -C. Graf v.
dc.creatorSchreyer, F. -O.
dc.date2004-04-19
dc.date.accessioned2026-07-07T06:26:52Z
dc.date.available2026-07-07T06:26:52Z
dc.descriptionWe 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.
dc.description11 pages, 4 figures; AMSlatex
dc.identifierhttps://arxiv.org/abs/math/0404342
dc.identifierhttp://arxiv.org/abs/math/0404342
dc.identifierExperimental Mathematics, Vol. 14 (2005), No. 4, pp 415-422
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/97245
dc.subjectAlgebraic Geometry
dc.subject12E05
dc.titleA quick and dirty irreducibility Test for Multivariate Polynomials over F_q
dc.typetext

Files

Collections

arXiv