We study the complexity of isomorphism problems for tensors, groups, and polynomials.
These problems have been studied in multivariate cryptography, machine learning, quantum …

The group isomorphism problem determines whether two groups, given by their Cayley
tables, are isomorphic. For groups with order n, an algorithm with n (log n+ O (1)) running …

In this article, we study some classical complexity-theoretic questions regarding Group
Isomorphism (GpI). We focus on p-groups (groups of prime power order) with odd p, which …

A novel concept of quantifying graph non-isomorphism is introduced to measure structural
differences between graphs, and thus overcoming the strict limitations of traditional graph …

We investigate the relationship between various isomorphism invariants for finite groups.
Specifically, we use the Weisfeiler-Leman dimension (WL) to characterize, compare and …

In this paper we consider the problems of testing isomorphism of tensors, $ p $-groups,
cubic forms, algebras, and more, which arise from a variety of areas, including machine …

Let p be an odd prime. From a simple undirected graph G, through the classical procedures
of Baer (1938), Tutte (1947) and Lovász (1989), there is a p-group PG of class 2 and …

In comparison to graphs, combinatorial methods for the isomorphism problem of finite
groups are less developed than algebraic ones. To be able to investigate the descriptive …

Motivated by testing isomorphism of p-groups, we study the alternating matrix space
isometry problem (AltMatSpIso), which asks to decide whether two m-dimensional …

We investigate the power of counting in Group Isomorphism. We first leverage the count-free
variant of the Weisfeiler–Leman Version I algorithm for groups [J. Brachter and P …