An algorithm for approximate counting of points on algebraic sets over finite fields

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1423, Issue , 1998, Pages 514-527

  Huang, Ming Deh ^a   Wong, Yiu Chung ^a  

^a University of Southern California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

APPROXIMATE COUNTING; COMBINATORIAL ANALYSIS; INPUT POLYNOMIALS; PARALLEL COMPLEXITY; POLYNOMIAL BOUNDS; POLYNOMIAL NUMBER; RANDOM POLYNOMIALS; RANDOMIZED ALGORITHMS;

NUMBER THEORY;

EID: 33947640477     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054889     Document Type: Conference Paper

References (17)

1. Leonard M. Adleman and Ming-Deh Huang, Primality testing and two dimensional Abelian varieties over finite fields, Lecture Notes in Mathematics, vol. 1512, Springer-Verlag, 1992.
2. Richard Beigel, The polynomial method in circuit complexity, Proceedings of 8th Annual Structure in Complexity Theory Conference, IEEE Computer Society Press, May 1993, pp. 82-95.
3. Shafi Goldwasser and Joe Kilian, Almost all primes can be quickly certified, Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing (Berkeley, California), 28-30 May 1986, pp. 316-329.
4. Dima Grigoriev and Marek Karpinski, An approximation algorithm for the number of zeros of arbitrary polynomial over GF[q], Proceedings of 32nd IEEE Symposium on Foundation of Computer Science, 1991, pp. 662-669.
5. Ming-Deh Huang and Doug Ierardi, Counting rational points on curves over finite fields, Proceedings of 34th IEEE Symposium on Foundation of Computer Science, IEEE, 1993, pp. 616-625.
6. Ming-Deh Huang and Yiu-Chung Wong, Solving systems of polynomial congruences modulo a large prime, Proceedings of IEEE Symposium on Foundations of Computer Science, 1996, pp. 115-124.
7. Ming-Deh Huang and Yiu-Chung Wong, Solving systems of polynomial equations modulo a large prime, manuscript, a full version of [HW96].
8. Douglas John Ierardi, The complexity of quantifier elimination in the theory of an algebraically closed field, Ph.D. thesis, Department of Computer Science, Cornell University, Ithaca, New York 14853-7501, 1989, also available as Technical Report no. TR 89-1030 of Computer Science Department, Cornell University.
9. Erich Kaltofen, Effective Noether irreducibility forms and applications, Journal of Computer and System Sciences, 50 (1995), no. 2, 274-295.
10. Marek Kaxpinski and Michael Luby, Approximating the number of zeroes of a GF[2] polynomial, Journal of Algorithms, 14 (1993), 280-287.
11. David B. Leep and Charles C. Yeomans, The number of points on a singular curve over a finite field, Arch. Math., 63 (1994), 420-426.
12. Noam Nisan and Avi Wigderson, Hardness vs randomness, Proceedings of 29th Annual IEEE Symposium on Foundations of Computer Science, 1988, pp. 2-11.
13. Wolfgang M. Schmidt, A lower bound for the number of solutions of equations over finite fields, Journal of Number Theory, 6 (1974), 448-480.
14. Goro Shimura, Reduction of algebraic varieties with respect to a discrete valuation of the basic field, American Journal of Mathematics, 77 (1955), 134-176.
15. Jacobus H. van Lint and Gerard van der Geer, Introduction to coding theory and algebraic geometry, DMV Seminar, no. Band 12, Birkhauser Verlag, 1988.
16. Joachim von zur Gathen, Marek Karpinski, and Igor Shparlinski, Counting curves and their projections, Proceedings of 25th ACM Symposium on Theory of Computing, The Association of Computing Machinery, May 1993, pp. 805-812.
17. Joachim von zur Gathen and Igor Shparlinski, Finding points on curves over finite fields, Proceedings of 36th IEEE Symposium on Foundation of Computer Science, 1995.