Probabilistic algorithms for sparse polynomials-Reference-Cited by-同舟云学术

Probabilistic algorithms for sparse polynomials

Published:1979 Issue: Volume: Page:216-226
ISSN:0302-9743
Container-title:Symbolic and Algebraic Computation
language:
Short-container-title:

Author:

Zippel Richard

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-09519-5_73.pdf

Reference11 articles.

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.

Cited by 313 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Symbolic matrix factorization for differential-algebraic equations index reduction;Journal of Computational and Applied Mathematics;2024-10

2. Hitting Sets for Orbits of Circuit Classes and Polynomial Families;ACM Transactions on Computation Theory;2024-09-10

3. A Verifiable and Privacy-Preserving Federated Learning Training Framework;IEEE Transactions on Dependable and Secure Computing;2024-09

4. On the Information Theoretic Secure Aggregation With Uncoded Groupwise Keys;IEEE Transactions on Information Theory;2024-09

5. Optimal RS Codes and GRS Codes Against Adversarial Insertions and Deletions and Optimal Constructions;IEEE Transactions on Information Theory;2024-09