76 search results - page 1 / 16 » Testing Polynomials over General Fields |
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time ...
MOC
2000
13 years 4 months ago
2000
The purpose of this paper is to describe a method to determine whether a bivariate polynomial with rational coefficients is irreducible when regarded as an element in Q((x))[y], th...
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
The properties of any system of k simultaneous equations in n variables over GF(q), are studied, with a particular emphasis on unsatisfiable systems. A general formula for the num...