Probabilistic algorithms for sparse polynomials

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

Volumn 72 LNCS, Issue , 1979, Pages 216-226

  Zippel, Richard ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

MODULAR ALGORITHMS; PROBABILISTIC ALGORITHM; SPARSE POLYNOMIALS; SPARSE TECHNIQUES;

ALGEBRA;

EID: 84925463455     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-09519-5_73     Document Type: Conference Paper

References (11)

1. S. Brown, “On Euclid’s Algorithm and the Computation of Polynomial Greatest Divisors,” J. ACM 18, 4 (1971), 478-504.
2. MATHLAB Group, MACSYMA Reference Manual-version 9, Laboratory for Computer Science, Massachusetts Institute of Technology, (1978).
3. J. Moses and D. Y. Y. Yun, “The EZGCD algorithm,” Proceedings of ACM Nat. Conf.(1973), 159-166.
4. D. R. Musser, “Multivariate Polynomial Factoring,” J. ACM 22, 2 (1975), 291-308.
5. M. O. Rabin, “Probabilistic Algorithms,” Algorithms and Complexity-New Directions and Recent Results (J. F. Traub Ed.), Acad. Press, New York, (1976), 21-39.
6. R. Solovay and V. Strassen, “A Fast Monte-Carlo Test for Primality,” SIAM J. of Comp. 6, 1 (1977).
7. P. S.-H. Wang and L. P. Rothschild, “Factoring Multivariate Polynomials over the Integers,” Math. Comp. 29, (1975), 935-950.
8. P. S.-H. Wang, “An Improved Multivariate Polynomial Factoring Algorithm,” Math. Comp.32, (1978), 1215-1231.
9. D. Y. Y. Yun, The Hensel Lemma in Algebraic Manipulation, Ph. D. thesis, Massachusetts Institute of Technology, (1974).
10. H. Zassenhaus, “On Hensel Factorization I,” J. Number Theory 1, (1969), 291-311.
11. R. E. Zippel, Probabilistic Algorithms for Sparse Polynomials, Ph. D. thesis, Massachusetts Institute of Technology, (1979).