Sciweavers

73 search results - page 1 / 15
» Decidability of Sub-theories of Polynomials over a Finite Fi...
Sort
View
CIE
2009
Springer
14 years 3 months ago
Decidability of Sub-theories of Polynomials over a Finite Field
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...
Alla Sirokofskich
COCO
2008
Springer
100views Algorithms» more  COCO 2008»
13 years 11 months ago
Detecting Rational Points on Hypersurfaces over Finite Fields
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...
Swastik Kopparty, Sergey Yekhanin
CORR
2010
Springer
166views Education» more  CORR 2010»
13 years 9 months ago
On Exponential Sums, Nowton identities and Dickson Polynomials over Finite Fields
Let Fq be a finite field, Fqs be an extension of Fq, let f(x) Fq[x]
Xiwang Cao, Lei Hu
STOC
1995
ACM
135views Algorithms» more  STOC 1995»
14 years 26 days ago
Subquadratic-time factoring of polynomials over finite fields
New probabilistic algorithms are presented for factoring univariate polynomials over finite fields. The algorithms factor a polynomial of
Erich Kaltofen, Victor Shoup
ARITH
2009
IEEE
14 years 4 months ago
Polynomial Multiplication over Finite Fields Using Field Extensions and Interpolation
A method for polynomial multiplication over finite fields using field extensions and polynomial interpolation is introduced. The proposed method uses polynomial interpolation a...
Murat Cenk, Çetin Kaya Koç, Ferruh &...