In this paper, we show that the constant-dimensional Weisfeiler–Leman algorithm for groups
(Brachter & Schweitzer, LICS 2020) can be fruitfully used to improve parallel complexity …

In this paper, we show that Graph Isomorphism (GI) is not $\textsf {AC}^{0} $-reducible to
several problems, including the Latin Square Isotopy problem, isomorphism testing of …

In this paper, we investigate the complexity of computing the minimal faithful permutation
degree for groups without abelian normal subgroups. When our groups are given as …

In this paper, we show that the constant-dimensional Weisfeiler-Leman algorithm for groups
(Brachter & Schweitzer, LICS 2020) can be fruitfully used to improve parallel complexity …

In this thesis, we investigate the combinatorial and logical complexities of several algebraic
structures, including groups, quasigroups, certain families of strongly regular graphs, and …

We investigate the power of the counting and count-free variants of the Weisfeiler–Leman
(WL) Version I algorithm for groups (Brachter & Schweitzer, LICS 2020).• We study the …

We investigate the constant-depth circuit complexity of the Isomorphism Problem, Minimum
Generating Set Problem (MGS), and Sub (quasi) group Membership Problem (Membership) …