Interpolation of sparse multivariate polynomials over large finite fields with applications

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 508-517

  Huang, Ming Deh A ^a   Rao, Ashwin J ^a  

^a University of Southern California ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERPOLATION; MULTIVARIABLE SYSTEMS; PARALLEL ALGORITHMS;

COMPLEX FIELDS; FINITE FIELDS; INTERPOLATION ALGORITHMS; MULTIVARIATE POLYNOMIAL; MULTIVARIATE POLYNOMIAL FACTORIZATION; SPACE EFFICIENT ALGORITHMS;

POLYNOMIALS;

EID: 0040597488     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. M. Ben-Or and P. Tiwari. A deterministic algorithm for sparse multivariate polynomial interpolation. In Proceedings of the 20th ACM Symposium on the Theory of Computing, pages 301-309, 1988.
2. M. Clausen, A. Dress, J. Grabmeier, and M. Karpinski. On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields. Theoretical Computer Science, 1990.
3. Dima Yu Grigoriev, Marek Karpinski, and Michael F. Singer. Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields. SIAM Journal on Computing, 19:1059-63, D '90.
4. Erich Kaltofen. Effective hilbert irreducibility. Inf. Control, 66:123-137, 1985.
5. Erich Kaltofen. Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization. SIAM Journal on Computing, 14:469-489, May 1985.
6. Erich Kaltofen and Barry M. Trager. Computing with polynomials given by black boxes for their evaluations: greatest common divisorsfactorization, separation of numerators and denominators. Journal of Symbolic Computation, 9:301-320, 1990.
7. A.K. Lenstra. Factoring multivariable polynomials over finite fields. In Proc. 15th ACM STOC, pages 189-192, 1983.
8. M. Mignotte. Mathematics for Computer Algebra. Springer-Verlag, New York, 1992.
9. Joachim Von Zur Gathen. Factoring sparse multivariate polynomials. In Proc. 1983 IEEE Symposium on Foundations of Computer Science, pages 172-197, 1983.
10. J. Von Zur Gathen and E. Kaltofen. A polynomial-time algorithm for factoring multivariate polynomials over finite fields. In Proc. 1983 International Conference on Automata, Langauages and Programming, Lecture Notes in Computer Science, Volume 154, pages 250-263. Springer, Berlin, 1983.
11. Joachim Von Zur Gathen. Parallel algorithms for algebraic problems. SIAM Journal on Computing, 13:802-24, N' 84.