Flexible constraint satisfiability and a problem in semigroup theory
Logic
2026-02-12 v4 Computational Complexity
Logic in Computer Science
Combinatorics
Abstract
We examine some flexible notions of constraint satisfaction, observing some relationships between model theoretic notions of universal Horn class membership and robust satisfiability. We show the \texttt{NP}-completeness of -robust monotone 1-in-3 3SAT in order to give very small examples of finite algebras with \texttt{NP}-hard variety membership problem. In particular we give a -element algebra with this property, and solve a widely stated problem by showing that the -element Brandt monoid has \texttt{NP}-hard variety membership problem. These are the smallest possible sizes for a general algebra and a semigroup to exhibit \texttt{NP}-hardness for the membership problem of finite algebras in finitely generated varieties.
Keywords
Cite
@article{arxiv.1512.03127,
title = {Flexible constraint satisfiability and a problem in semigroup theory},
author = {Marcel Jackson},
journal= {arXiv preprint arXiv:1512.03127},
year = {2026}
}