Light's associativity test
In mathematics, Light's associativity test is a procedure invented by F. W. Light for testing whether a binary operation defined in a finite set by a Cayley multiplication table is associative. The naive procedure for verification of the associativity of a binary operation specified by a Cayley table, which compares the two products that can be formed from each triple of elements, is cumbersome. Light's associativity test simplifies the task in some instances (although it does not improve the worst-case runtime of the naive algorithm, namely O(n^3) for sets of size n).
Wikipage redirect
primaryTopic
Light's associativity test
In mathematics, Light's associativity test is a procedure invented by F. W. Light for testing whether a binary operation defined in a finite set by a Cayley multiplication table is associative. The naive procedure for verification of the associativity of a binary operation specified by a Cayley table, which compares the two products that can be formed from each triple of elements, is cumbersome. Light's associativity test simplifies the task in some instances (although it does not improve the worst-case runtime of the naive algorithm, namely O(n^3) for sets of size n).
has abstract
In mathematics, Light's associ ...... ly O(n^3) for sets of size n).
@en
Test łączności Lighta – proced ...... ghta bardzo upraszcza zadanie.
@pl
Wikipage page ID
22,783,408
Wikipage revision ID
740,233,169
hypernym
comment
In mathematics, Light's associ ...... ly O(n^3) for sets of size n).
@en
Test łączności Lighta – proced ...... ghta bardzo upraszcza zadanie.
@pl
label
Light's associativity test
@en
Test łączności Lighta
@pl