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 …

We study how the complexity of modular circuits computing AND depends on the depth of
the circuits and the prime factorization of the modulus they use. In particular our construction …

We show that CC-circuits of bounded depth have the same expressive power as circuits
over finite nilpotent algebras from congruence modular varieties. We use this result to …

Over twenty years ago, Goldmann and Russell initiated the study of the complexity of the
equation satisfiability problem (PolSat and the NUDFA program satisfiability problem …

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 …

The satisfiability of Boolean circuits is NP-complete in general but becomes polynomial time
when restricted either to monotone gates or linear gates. We go outside the Boolean realm …

The circuit satisfaction problem CSAT (A) of an algebra A is the problem of deciding whether
an equation over A (encoded by two circuits) has a solution or not. While solving systems of …

We consider finite algebraic structures and ask whether every solution of a given system of
equations satisfies some other equation. This can be formulated as checking the validity of …

We present a functorial construction which, starting from a congruence α α of finite index in
an algebra AA, yields a new algebra CC with the following properties: the congruence lattice …