Verification of Identities

  title={Verification of Identities},
  author={Sridhar Rajagopalan and Leonard J. Schulman},
  journal={SIAM J. Comput.},
We provide an O(n2 log 1 δ ) time randomized algorithm to check whether a given operation ◦ : S × S → S is associative (where n = |S| and δ > 0 is the error probability required of the algorithm). We prove that (for any constant δ) this performance is optimal up to a constant factor, even if the operation is “cancellative.” No sub-n3 time algorithm was previously known for this task. More generally we give an O(nc) time randomized algorithm to check whether a collection of c-ary operations… CONTINUE READING

From This Paper

Topics from this paper.
10 Citations
9 References
Similar Papers


Publications referenced by this paper.
Showing 1-9 of 9 references

Basic Algebra II

  • N. Jacobson
  • W. H. Freeman, San Francisco, CA
  • 1980
1 Excerpt

Unifying internal and external symmetry

  • A. Weinstein
  • Notices Amer . Math . Soc .
  • 1980

What is a loop? in Studies in Modern Algebra

  • R. H. Bruck
  • Studies in Mathematics 2, The Mathematical…
  • 1963
2 Excerpts

The Algebraic Theory of Semigroups

  • A. H. Clifford, G. B. Preston
  • AMS, Providence, RI
  • 1961
2 Excerpts

A Survey of Binary Systems

  • R. H. Bruck
  • Springer-Verlag, Berlin
  • 1958
2 Excerpts

Similar Papers

Loading similar papers…