research
∙
02/08/2022
Two-closure of rank 3 groups in polynomial time
A finite permutation group G on Ω is called a rank 3 group if it has pre...
share
research
∙
12/24/2021
The probabilistic Weisfeiler-Leman algorithm
A probabilistic version of the Weisfeiler-Leman algorithm for computing ...
research
∙
07/31/2018
Subgroups of minimal index in polynomial time
Let G be a finite group and let H be a proper subgroup of G of minimal i...
research
∙
07/31/2018
