On some approximation problems concerning sparse polynomials over finite fields

Theoretical Computer Science

Volumn 157, Issue 2, 1996, Pages 259-266

  Karpinski, Marek ^a   Shparlinski, Igor ^b  

^a UNIVERSITY OF BONN   (Germany)

^b MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ESTIMATION; FINITE AUTOMATA; IMAGE PROCESSING; MONTE CARLO METHODS; PROBABILITY;

APPROXIMATION PROBLEMS; BLACK BOX; FINITE FIELDS; MULTIVARIATE SPARSE POLYNOMIALS;

POLYNOMIALS;

EID: 0030570123     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00162-X     Document Type: Article

References (16)

1. L.M. Adleman and H.W. Lenstra, Finding irreducible polynomials over finite fields, in: Proc. 18th ACM Symp. on Theory of Comp. (1986) 350-355.
2. M. Clausen, A. Dress, J. Grabmeier and M. Karpinski, On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields, SIAM J. Comput. 19 (1990) 1059-1063.
3. D. Grigoriev and M. Karpinski, Lower bounds for the number of zeros of multivariate polynomials over GF(q), Research Report No.8569-CS, University of Bonn, 1991, 1-5.
4. D. Grigoriev and M. Karpinski, An approximation algorithm for the number of zeros of arbitrary polynomials over GF(q), Proc. 32nd Ann. Symp. on Found. of Comp. Sci. (1991) 662-669.
5. D. Grigoriev, M. Karpinski and M. Singer, Fast parallel algorithm for sparse multivariate polynomials over finite fields, SIAM J. Comput. 19 (1990) 1059-1063.
6. R. Karp, M. Luby and N. Madras, Monte-Carlo approximation algorithms for enumeration problems, J. of Algorithms 10 (1989) 429-448.
7. M. Karpinski, Boolean circuit complexity of algebraic interpolation problems, in: Lecture Notes in Computer Science, Vol. 385 (Spinger, Berlin, 1989) 138-147.
8. M. Karpinski and B. Lhotzky, An (ε, δ)-approximation algorithm of the number of zeros for a multilinear polynomial over GF(q), Preprint TR-91-022, Intern. Comp. Sci. Inst. Berkeley 1991, 1-12.
9. M. Karpinski and M. Luby, Approximating the number of zeros for a GF(2) polynomial, J. Algorithms 14 (1993) 280-287.
10. G.I. Perelmuter and I.E. Shparlinski, On the distribution of primitive roots in finite fields, Uspechi Matem. Nauk 45 (1) (1990) 185-186 (in Russian).
11. V. Shoup, New algorithms for finding irreducible polynomials over finite fields, Math. Comp. 54 (1990) 435-447.
12. V. Shoup, Searching for primitive roots in finite fields, Math. Comp. 58 (1992) 369-380.
13. V. Shoup, Fast construction of irreducible polynomials over finite fields, J. Symbolic. Comput. 17 (1994) 371-391.
14. I. Shparlinski, On primitive elements in finite fields and on elliptic curves, Matem. Sbornik 181 (9) (1990) 1196-1206 (in Russian).
15. I. Shparlinski, Computational and algorithmic problems in finite fields (Kluwer Academic Publisher, The Netherlands, 1992).
16. K. Werther, The computational complexity of interpolationg sparse multivariate polynomials over finite fields, Appl. Algebra in Eng. Commun. and Comput. Appl. Algebra 5 (1994) 91-103.