Technical Report CS0419

Title: Probabilistic Algorithms in Integer and Polynomial Arithmetic
Authors: Michael Kaminski
Abstract: We present a probabilistic algorithm for testing the result of the product of two n-bit integers (polynomials of degree n over any field) in 4n+o(n) bit (algebraic) operations with the error probability O(n^-epsilon) for any epsilon < 0.5.
CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (, rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1986
To the main CS technical reports page

Computer science department, Technion