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

Motivated by the desire for better isomorphism tests for finite groups, we present a
polynomial-time algorithm for deciding isomorphism within a class of p-groups that is well …

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 …

We study the polynomial equivalence problem for orbits of read-once arithmetic formulas
(ROFs). Read-once formulas have received considerable attention in both algebraic and …

Left-right and conjugation actions on matrix tuples have received considerable attention in
theoretical computer science due to their connections with polynomial identity testing, group …

A smooth cuboid can be identified with a $3\times 3$ matrix of linear forms, with coefficients
in a field $ K $, whose determinant describes a smooth cubic in the projective plane. To …

Motivated by the need for efficient isomorphism tests for finite groups, we present a
polynomial-time method for deciding isomorphism within a class of groups that is well-suited …

Algorithms for finite rings Page 1 Algorithms for finite rings Ciocanea Teodorescu, I. Citation
Ciocanea Teodorescu, I. (2016, une 22). . Retrie ed from https://hdl.handle.net/1887/40676 …

Equivalence testing for a polynomial family {g_m} over a field F is the following problem:
Given black-box access to an n-variate polynomial f (x), where n is the number of variables …

In this thesis we are interested in describing algorithms that answer questions arising in ring
and module theory. Our focus is on deterministic polynomial-time algorithms and rings and …