Perfectly secure message transmission
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 …
which processors and communication lines may be faulty. Lower bounds are obtained on …
Deciding the existence of minority terms
This paper investigates the computational complexity of deciding if a given finite idempotent
algebra has a ternary term operation. We show that a common polynomial-time approach to …
algebra has a ternary term operation. We show that a common polynomial-time approach to …
On the complexity dichotomy for the satisfiability of systems of term equations over finite algebras
P Mayr - … Symposium on Mathematical Foundations of Computer …, 2023 - drops.dagstuhl.de
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 …
system of term equations have a solution in 𝐀? This is equivalent to a constraint satisfaction …
Mal'cev classes of left quasigroups and quandles
M Bonatto, S Fioravanti - Quasigroups and related systems, 2021 - ibn.idsi.md
In this paper we investigate some Mal'cev classes of varieties of left quasigroups. We prove
that the weakest non-trivial Mal'cev condition for a variety of left quasigroups is having a …
that the weakest non-trivial Mal'cev condition for a variety of left quasigroups is having a …
Loop conditions
M Olšák - Algebra universalis, 2020 - Springer
Loop conditions | SpringerLink Skip to main content Advertisement SpringerLink Account Menu
Find a journal Publish with us Search Cart 1.Home 2.Algebra universalis 3.Article Download PDF …
Find a journal Publish with us Search Cart 1.Home 2.Algebra universalis 3.Article Download PDF …
Topology is irrelevant (in a dichotomy conjecture for infinite domain constraint satisfaction problems)
The tractability conjecture for finite domain Constraint Satisfaction Problems (CSPs) stated
that such CSPs are solvable in polynomial time whenever there is no natural reduction, in …
that such CSPs are solvable in polynomial time whenever there is no natural reduction, in …
On structural completeness versus almost structural completeness problem: a discriminator varieties case study
M Campercholi, MM Stronkowski… - Logic Journal of the …, 2015 - academic.oup.com
We study the following problem: determine which almost structurally complete quasivarieties
are structurally complete. We propose a general solution to this problem and then a solution …
are structurally complete. We propose a general solution to this problem and then a solution …
Lattices of varieties of plactic-like monoids
T Aird, D Ribeiro - Semigroup Forum, 2024 - Springer
We study the equational theories and bases of meets and joins of several varieties of plactic-
like monoids. Using those results, we construct sublattices of the lattice of varieties of …
like monoids. Using those results, we construct sublattices of the lattice of varieties of …
The Agda Universal Algebra Library, Part 1: Foundation
W DeMeo - arXiv preprint arXiv:2103.05581, 2021 - arxiv.org
The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems
and proofs) we developed to formalize the foundations of universal algebra in dependent …
and proofs) we developed to formalize the foundations of universal algebra in dependent …
Structural completeness in many-valued logics with rational constants
Abstract The logics R Ł, RP, and RG have been obtained by expanding Łukasiewicz logic Ł,
product logic P, and Gödel–Dummett logic G with rational constants. We study the lattices of …
product logic P, and Gödel–Dummett logic G with rational constants. We study the lattices of …