This paper studies the problem of perfectly secure communication in general network in
which processors and communication lines may be faulty. Lower bounds are obtained on …

This paper focuses on the algebraic theory underlying the study of the complexity and the
algorithms for the Constraint Satisfaction Problem (CSP). We unify, simplify, and extend …

An equational condition is a set of equations in an algebraic language, and an algebraic
structure satisfies such a condition if it possesses terms that meet the required equations …

In the paper we describe the class of principal quandles and we show that connected
quandles can be decomposed as a disjoint union of principal quandles. We also prove that …

This paper presents new results on the identities satisfied by the sylvester and Baxter
monoids. We show how to embed these monoids, of any rank strictly greater than 2, into a …

Maltsev families of varieties closed under join or Maltsev product Page 1 Algebra Universalis
Maltsev families of varieties closed under join or Maltsev product Ralph Freese and Ralph …

In this paper we investigate the computational complexity of deciding if the variety generated
by a given finite idempotent algebra satisfies a special type of Maltsev condition that can be …

For a fixed finite algebra 𝐀, we consider the decision problem SysTerm (𝐀): does a given
system of term equations have a solution in 𝐀? This is equivalent to a constraint satisfaction …

Loop conditions for strongly connected digraphs Page 1 International Journal of Algebra and
Computation Vol. 30, No. 3 (2020) 467–499 c© World Scientific Publishing Company DOI …

We present a new infinite family of finite-valued paraconsistent logics—whose n-th member
we call Sette's logic of order n and denote by\({\mathscr {S}} _n\)—all of which extending da …