Goldmann and Russell (2002) initiated the study of the complexity of the equation
satisfiability problem in finite groups by showing that it is in P for nilpotent groups while it is …

This paper presents new findings on varieties generated by small semigroups and groups,
and offers a survey of existing results. A companion website is provided which hosts a …

The study of the complexity of the equation satisfiability problem in finite groups had been
initiated by Goldmann and Russell in (Inf. Comput. 178 (1), 253–262,) where they showed …

The circuit equivalence problem of a finite algebra $\mathbf A $ is the computational
problem of deciding whether two circuits over $\mathbf A $ define the same function or not …

We investigate under which structural assumptions on a finite algebra A the problem 3SAT
with complexity measure the number of clauses can be reduced to POLSAT(A) in logarithmic …

The study of the complexity of the equation satisfiability problem in finite groups had been
initiated by Goldmann and Russell in [10] where they showed that this problem is in P for …

Eines der grundlegendsten Probleme der algorithmischen Gruppentheorie ist das
Wortproblem, das erstmals 1911 von Dehn beschrieben wurde [Deh11]. Für eine feste …

We investigate the complexity of solving systems of polynomial equations over finite groups.
We give a survey on the known results for solving equations over general algebras, rings …