Fast Probabilistic Algorithms for Verification of Polynomial Identities-Reference-Cited by-同舟云学术

Fast Probabilistic Algorithms for Verification of Polynomial Identities

Published:1980-10 Issue:4 Volume:27 Page:701-717
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Schwartz J. T.¹

Affiliation:

1. Computer Science Department, Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference21 articles.

1. AHO A. HOPCROFT J. AND ULLMAN J The Design and Analysis of Computer Algorzthms Addison-Wesley Reading Mass. 1974. AHO A. HOPCROFT J. AND ULLMAN J The Design and Analysis of Computer Algorzthms Addison-Wesley Reading Mass. 1974.

2. BIEBERBACH L AND BAUER G Vorlesungen uber Algebra. B G Teubner Pubhshmg Co Berhn 1928. BIEBERBACH L AND BAUER G Vorlesungen uber Algebra. B G Teubner Pubhshmg Co Berhn 1928.

3. CHAITIN G. AND SCHWARTZ J.T. A note on Monte Carlo pmnallty tests and algorithmic reformation theory Commun Pure Appl Math. (1978) CHAITIN G. AND SCHWARTZ J.T. A note on Monte Carlo pmnallty tests and algorithmic reformation theory Commun Pure Appl Math. (1978)

4. The Calculation of Multivariate Polynomial Resultants

5. Computer algebra of polynomials and rattonal functions Amer;COLLINS G.E;Math Monthly,1973

Cited by 968 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