Is it necessary to check every possible triple of values to confirm a binary operation is associative?

31 Views Asked by At

Is it possible to use less than n^3 (where n is the cardinality of the set the operation works on)? That is, is there some way to choose triples to test for associativity so that the associativity of the triples that have not been chosen is implied by the ones that have been chosen?