Title :
Verifying identities
Author :
Rajagopalan, Sridhar ; Schulman, Leonard J.
Author_Institution :
Princeton Univ., NJ, USA
Abstract :
The authors provide an O˜(n2) time randomized algorithm to check whether a given operation f:S×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(nc ) time randomized algorithm to check whether a collection of c-ary operations satisfy any given “read-once” identity
Keywords :
associative processing; computational complexity; formal verification; randomised algorithms; associative operation; c-ary operations; identity verification; optimal performance; read-once identity; time randomized algorithm; Automata; Error probability; Testing;
Conference_Titel :
Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on
Conference_Location :
Burlington, VT
Print_ISBN :
0-8186-7594-2
DOI :
10.1109/SFCS.1996.548520
