73 search results - page 1 / 15 » Decidability of Sub-theories of Polynomials over a Finite Fi... |
CIE
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
COCO
2008
Springer
13 years 11 months ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Let Fq be a finite field, Fqs be an extension of Fq, let f(x) Fq[x]
STOC
1995
ACM
14 years 28 days ago
1995
ACM
New probabilistic algorithms are presented for factoring univariate polynomials over finite fields. The algorithms factor a polynomial of
ARITH
2009
IEEE
14 years 4 months ago
2009
IEEE
A method for polynomial multiplication over finite fields using field extensions and polynomial interpolation is introduced. The proposed method uses polynomial interpolation a...