Counting curves and their projections

Some deterministic and probabilistic methods are presented for counting and estimating the number of points on curves over finite fields, and on their projections. The classical question of estimating the size of the image of a univariate polynomial is a special case. For curves given by sparse polynomials, the counting problem is #P-complete via probabilistic parsimonious Turing reductions.

[1]  Ming-Deh A. Huang,et al.  Counting rational points on curves over finite fields , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[2]  H. P. F. Swinnerton-Dyer,et al.  Note on a problem of Chowla , 1959 .

[3]  Arjen K. Lenstra,et al.  Factoring multivariate polynomials over finite fields , 1983, J. Comput. Syst. Sci..

[4]  Alexei N. Skorobogatov,et al.  Exponential sums and rational points on complete intersections , 1990 .

[5]  Erich Kaltofen,et al.  Greatest common divisors of polynomials given by straight-line programs , 1988, JACM.

[6]  I. Shafarevich.  Basic algebraic geometry , 1974 .

[7]  Joachim von zur Gathen.  Tests for Permutation Polynomials , 1991, SIAM J. Comput..

[8]  Marek Karpinski,et al.  Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields , 1988, SIAM J. Comput..

[9]  Kevin S. McCurley,et al.  Explicit zero-free regions for Dirichlet L-functions , 1984 .

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  David A. Plaisted,et al.  New NP-hard and NP-complete polynomial and integer divisibility problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[12]  Igor E. Shparlinski,et al.  Components and Projections of Curves over Finite Fields , 1994, ISAAC.

[13]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[14]  Marek Karpinski,et al.  An approximation algorithm for the number of zeros or arbitrary polynomials over GF(q) , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[15]  S. Vladut,et al.  Number of points of an algebraic curve , 1983 .

[16]  Erich Kaltofen,et al.  Fast Parallel Absolute Irreducibility Testing , 1985, J. Symb. Comput..

[17]  Igor E. Shparlinski,et al.  Computational and Algorithmic Problems in Finite Fields , 1992 .

[18]  Igor E. Shparlinski,et al.  Number Theoretic and Algebraic Methods in Computer Science: Proceedings of the International Conference , 1995 .

[19]  Richard M. Karp,et al.  Monte-Carlo Approximation Algorithms for Enumeration Problems , 1989, J. Algorithms.

[20]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[21]  Arjen K. Lenstra.  Factoring Multivariate Polynomials over Finite Fields , 1985, J. Comput. Syst. Sci..

[22]  R. Schoof.  Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p , 1985 .

[23]  David A. Plaisted.  Sparse Complex Polynomials and Polynomial Reducibility , 1977, J. Comput. Syst. Sci..

[24]  Erich Kaltofen,et al.  On computing greatest common divisors with polynomials given by black boxes for their evaluations , 1995, ISSAC '95.

[25]  Victor Shoup,et al.  Searching for primitive roots in finite fields , 1990, STOC '90.

[26]  J. Rosser,et al.  Approximate formulas for some functions of prime numbers , 1962 .

[27]  I. E. Shparlinskii,et al.  ON PRIMITIVE ELEMENTS IN FINITE FIELDS AND ON ELLIPTIC CURVES , 1992 .

[28]  V. Shoup.  Searching for primitive roots in finite fields , 1990, Symposium on the Theory of Computing.

[29]  J. Gathen,et al.  Factorization of multivariate polynomials over finite fields , 1985 .

[30]  Marek Karpinski,et al.  Approximating the number of zeroes of a GF[2] polynomial , 1991, SODA '91.

[31]  Marek Karpinski,et al.  On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials Over Finite Fields , 1991, Theor. Comput. Sci..

[32]  M. Luby,et al.  Approximating the Number of Solutions of a {\ G F [ 2 ]} Polynomial , 1990 .

[33]  Enrico Bombieri,et al.  On Exponential Sums in Finite Fields , 1966 .

[34]  C. Pomerance,et al.  There are infinitely many Carmichael numbers , 1994 .

[35]  H. Davenport.  Multiplicative Number Theory , 1967 .

[36]  J. Pila.  Frobenius maps of Abelian varieties and finding roots of unity in finite fields , 1990 .