The Community for Technology Leaders
Proceedings of 37th Conference on Foundations of Computer Science (1996)
Burlington, VT
Oct. 14, 1996 to Oct. 16, 1996
ISBN: 0-8186-7594-2
pp: 612
S. Rajagopalan , Princeton Univ., NJ, USA
L.J. Schulman , Princeton Univ., NJ, USA
ABSTRACT
The authors provide an ?(n2) time randomized algorithm to check whether a given operation f: S x S → S is associative (letting n=|S|). They prove this performance is optimal (up to polylogarithmic factors) even in case the operation is "cancellative". No sub-n3 algorithm was previously known for this task. More generally they give an O(n3) time randomized algorithm to check whether a collection of c-ary operations satisfy any given "read-once" identity.
INDEX TERMS
randomised algorithms; identity verification; time randomized algorithm; associative operation; optimal performance; c-ary operations; read-once identity
CITATION

S. Rajagopalan and L. Schulman, "Verifying identities," Proceedings of 37th Conference on Foundations of Computer Science(FOCS), Burlington, VT, 1996, pp. 612.
doi:10.1109/SFCS.1996.548520
80 ms
(Ver 3.3 (11022016))