A note on probabilistically verifying integer and polynomial products

Authors:
Michael Kaminski
Affiliations:
Israel Institute of Technology, Haifa, Israel
Venue:
Journal of the ACM (JACM)
Year:
1989

Citing 6
Cited 1

A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor

Journal of the ACM (JACM)
An algorithm for polynomial multiplication that does not depend on the ring constants

Journal of Algorithms
Fast Probabilistic Algorithms for Verification of Polynomial Identities

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Note on probabilistic algorithms in integer and polynomial arithmetic

SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
A lower bound to palindrome recognition by probabilistic Turing machines

A lower bound to palindrome recognition by probabilistic Turing machines

Self-testing/correcting with applications to numerical problems

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Probabilistic algorithms are presented for testing the result of the product of two n-bit integers in O(n) bit operations and for testing the result of the product of two polynomials of degree n over any integral domain in 4n + o(n) algebraic operations with the error probability o(l/n1-&egr;) for any &egr; 0. The last algorithm does not depend on the constants of the underlying domain.