Counting points on varieties over finite fields of small characteristic

By Alan G. B. Lauder, Daqing Wan. 2006

76 citations recorded by the source corpus.

We present a deterministic polynomial time algorithm for computing the zeta function of an arbitrary variety of fixed dimension over a finite field of small characteristic. One consequence of this result is an efficient method for computing the order of the group of rational points on the Jacobian of a smooth geometrically connected projective curve over a finite field of small characteristic. CONTENTS

Subfields: Artificial Intelligence, Geometry and Topology, Information Systems

View Paper: https://www.semanticscholar.org/paper/25f30f19e00cac835e34a1dda251bccf126f72e8