Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields
From MaRDI portal
Publication:5891177
DOI10.1137/110854680zbMath1348.11094arXiv0912.3312OpenAlexW2039025980MaRDI QIDQ5891177
Alfredo Viola, Joachim von zur Gathen, Konstantin Ziegler
Publication date: 26 September 2013
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0912.3312
generating functionsfinite fieldsmultivariate polynomialsanalytic combinatoricscounting problemscombinatorics on polynomials
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
On the computation of rational points of a hypersurface over a finite field ⋮ On the computation of rational solutions of underdetermined systems over a finite field ⋮ Normal form for Ritt's second theorem ⋮ Liminal reciprocity and factorization statistics
This page was built for publication: Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields
