✦ LIBER ✦

On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields

✍ Scribed by Michael Clausen; Andreas Dress; Johannes Grabmeier; Marek Karpinski

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 848 KB
Volume: 84
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90157-w

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of sparse polynomial inte

The complexity of sparse polynomial interpolation over finite fields

✍ Kai Werther 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 650 KB

On square-free factorization of multivar

On square-free factorization of multivariate polynomials over a finite field

✍ Laurent Bernardin 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 625 KB

In this paper we present a new deterministic algorithm for computing the square-free decomposition of multivariate polynomials with coefficients from a finite field. Our algorithm is based on Yun's square-free factorization algorithm for characteristic 0. The new algorithm is more efficient than ex

On the multiplicity of zeros of polynomi

On the multiplicity of zeros of polynomials over arbitrary finite dimensional K-algebras

✍ F. Leon Pritchard 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 928 KB

On Characteristic Polynomials of Formal

On Characteristic Polynomials of Formal Groups over Finite Fields

✍ Tetsuo Nakamura 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 580 KB

Explicit bounds of polynomial coefficien

Explicit bounds of polynomial coefficients and counting points on Picard curves over finite fields

✍ Gyoyong Sohn; Hoil Kim 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 517 KB

On the probability that the product of k

On the probability that the product of k n × n matrices over a finite field will be zero

✍ Amos Kovacs 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 332 KB