9 search results - page 1 / 2 » Modular Counting of Rational Points over Finite Fields |
FOCM
2008
13 years 11 months ago
2008
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...
ANTS
2006
Springer
14 years 26 days ago
2006
Springer
Abstract. We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an elliptic curve over a finite field, given a Weierstrass equation for the...
COCO
2008
Springer
14 years 21 days 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...
FFA
2011
13 years 5 months ago
2011
ABSTRACT. We prove the rationality of the generating function associated to the number of equivalence classes of Fqk -points of a constructible equivalence relation defined over t...
TIT
2010
13 years 5 months ago
2010
Abstract. In this note we use Carlitz's lifting formula for Kloosterman sums and some results from the theory of cyclotomic fields to show that a Kloosterman sum over a finite...