In this paper, we propose a practical signature scheme based on the alternating trilinear
form equivalence problem. Our scheme is inspired by the Goldreich-Micali-Wigderson's zero …

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 …

We consider two basic algorithmic problems concerning tuples of (skew-) symmetric
matrices. The first problem asks us to decide, given two tuples of (skew-) symmetric matrices …

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 …

In this paper we combine many of the standard and more recent algebraic techniques for
testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically …

We devise a unified framework for the design of canonization algorithms. Using hereditarily
finite sets, we define a general notion of combinatorial objects that includes graphs …

The isomorphism problem for finite groups of order n (GpI) has long been known to be
solvable in n^\logn+O(1) time, but only recently were polynomial-time algorithms designed …

In representation theory, a classification problem is called wild if it contains the problem of
classifying matrix pairs up to simultaneous similarity. The latter problem is considered …

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\textsc {Group Isomorphism}. We first leverage the
count-free variant of the Weisfeiler--Leman Version I algorithm for groups (Brachter & …