The Todd–Coxeter algorithm is a method used in group theory, specifically for computing the orbit and stabilizer of elements in a permutation group, and for finding a presentation of a group given by generators and relations. It's particularly useful in the study of finite groups and is often used in computational group theory.
Articles by others on the same topic
There are currently no matching articles.