Determining Equivalence of Expressions in Random Polynomial Time (Extended Abstract)

@inproceedings{Gonnet1984DeterminingEO,
  title={Determining Equivalence of Expressions in Random Polynomial Time (Extended Abstract)},
  author={Gaston H. Gonnet},
  booktitle={STOC},
  year={1984}
}
We devise several procedures based on signatures (or hashing functions) to determine equivalence of expressions in Random Polynomial Time (also called Probabilistic Polynomial Time) (RPT). These procedures return as result: “<italic>equivalent</italic>” or “<italic>not-equivalent</italic>”. The result “not-equivalent” is always correct, while the result “equivalent” is correct with probability at least 1-ε. This probability depends on a random number generator and is <italic>independent</italic… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…