Note on probabilistic algorithms in integer and polynomial arithmetic

Abstract

For many computational problems it is not known whether verification of a result can be done faster than its computation. For instance, it is unknown whether the verification of the validity of the integer equality x*y&equil;z needs fewer bit operations than a computation of the product x*y. It is sometimes much easier, however, to speed up the computation probabilistically if just the verification of the result is involved. In this paper we present linear probabilistic algorithms for verification of the validity of the integer equality f1(x1,...,xN)&equil;f2(x1,...,xN) for rational functions f1 and f2, which can be of the form of a rational combination of rational functions.