Computing components and projections of curves over finite fields

SIAM Journal on Computing

Volumn 28, Issue 3, 1999, Pages 822-840

  Von Zur Gathen, Joachim ^a   Shparlinski, Igor ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b MACQUARIE UNIVERSITY   (Australia)

Author keywords

Approximation algorithms; Computational algebraic geometry; Curves over finite fields

Indexed keywords

ALGEBRA; ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; POLYNOMIALS; SET THEORY;

ALGEBRAIC CURVES; COMPUTATIONAL ALGEBRAIC GEOMETRY;

COMPUTATIONAL GEOMETRY;

EID: 0032256263     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s009753979427741x     Document Type: Article

References (22)

1. E. BOMBIERI, On exponential sums in finite fields, Amer. J. Math., 88 (1960), pp. 71-105.
2. E. BOMBIERI AND H. DAVENPORT, On two problems of Mordell, Amer. J. Math., 88 (1966), pp. 61-70.
3. E. BRIESKORN AND H. KNÖRRER, Plane Algebraic Curves, Birkhäuser-Verlag, Basel, Switzerland, 1986.
4. S. D. COHEN, The distribution of polynomials over finite fields, Acta Arith., 17 (1970), pp. 255-271.
5. J. VON ZUR GATHEN, Values of polynomials over finite fields, Bull. Austral. Math. Soc., 43 (1991), pp. 141-146.
6. J. VON ZUR GATHEN AND M. GIESBRECHT, Constructing normal bases in finite fields, J. Symbolic Comput., 10 (1990), pp. 547-570.
7. J. VON ZUR GATHEN, M. KARPINSKI, AND I. E. SHIPARLINSKI, Counting curves and their projections, Comput. Complexity, 6 (1996), pp. 64-99.
8. J. VON ZUR GATHEN AND I. E. SHPARLINSKI, Finding points on curves over finite fields, in Proc. 36th Ann. IEEE Symp. on Foundations of Computer Science, 1995, pp. 284-292.
9. J. VON ZUR GATHEN AND I. E. SHPARLINSKI, Orders of Gauss periods in finite fields, Appl. Algebra Engrg. Comm. Comput., 9 (1998), pp. 15-24.
10. R. HARTSHORNE, Algebraic Geometry, Springer-Verlag, New York, 1977.
11. M.-D. HUANG AND D. IERARDI, Counting rational points on curves over finite fields, in Proc. 34th Ann. IEEE Symp. on Foundations of Computer Science, Palo Alto, CA, 1993, pp. 616-625.
12. M.-D. HUANG AND Y.-C. WONG, Solving systems of polynomial congruences modulo a large prime, in Proc. of 1996 IEEE Symp. on Foundations of Computer Science, 1996, pp. 115-124.
13. R. M. KARP, M. LUBY, AND N. MADRAS, Monte-Carlo approximation algorithms for enumeration problems, J. Algorithms, 10 (1989), pp. 429-448.
14. R. LIDL AND H. NIEDERREITER, Finite fields, in Encyclopedia of Mathematics and Its Applications 20, Addison-Wesley, Reading, MA, 1983.
15. G. I. PEREL'MUTER, (Bounds on sums along algebraic curves), Mat. Zametki, 5 (1969), pp. 373-380.
16. G. I. PEREL'MUTER AND I. E. SHPARLINSKI, (On the distribution of primitive roots in finite fields), Uspekhi Mat. Nauk, 45 (1990), pp. 185-186.
17. R. PILA, Frobenius maps of Abelian varieties and finding roots of unity in finite fields, Math. Comput., 55 (1990), pp. 745-763.
18. A. SCHÖNHAGE AND V. STRASSEN, Schnelle Multiplikation großer Zahlen, Computing, 7 (1971), pp. 281-292.
19. R. J. SCHOOF, Elliptic curves over finite fields and the computation of square roots mod p, Math. Comput., 44 (1985), pp. 483-494.
20. V. SHOUP, Searching for primitive roots in finite fields, Math. Comp., 58 (1992), pp. 369-380.
21. I. E. SHPARLINSKI, On primitive elements in finite fields and on elliptic curves, Math. USSR Sbornik, 71 (1992), pp. 41-50.
22. I. E. SHPARLINSKI, Computational and Algorithmic Problems in Finite Fields, Math. Appl. 88., Kluwer Academic Publishers, Norwell, MA, 1992.