73 search results - page 2 / 15 » Decidability of Sub-theories of Polynomials over a Finite Fi... |
CORR
2006
Springer
13 years 6 months ago
2006
Springer
In this paper we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speed up of the decoding process of BCH, Reed-S...
CORR
2008
Springer
13 years 6 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
2002
13 years 5 months ago
2002
This paper presents an average time analysis of a Hensel lifting based factorisation algorithm for bivariate polynomials over finite fields. It is shown that the average running ti...
ISSAC
1997
Springer
13 years 10 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
FOCS
2007
IEEE
14 years 18 days ago
2007
IEEE
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...