DeepAI AI Chat
Log In Sign Up

Deciding the existence of minority terms

by   Alexandr Kazda, et al.
Lomonosov Moscow State University
Durham University
McMaster University

This paper investigates the computational complexity of deciding if a given finite idempotent algebra has a ternary term operation m that satisfies the minority equations m(y,x,x) ≈ m(x,y,x) ≈ m(x,x,y) ≈ y. We show that a common polynomial-time approach to testing for this type of condition will not work in this case and that this decision problem lies in the class NP.


page 1

page 2

page 3

page 4


Deciding the existence of quasi weak near unanimity terms in finite algebras

We show that for a fixed positive integer k one can efficiently decide i...

Computational Complexity of Multi-Player Evolutionarily Stable Strategies

In this paper we study the computational complexity of computing an evol...

Deciding Equations in the Time Warp Algebra

Join-preserving maps on the discrete time scale ω^+, referred to as time...

Existence of cube terms in finite finitely generated clones

We study the problem of whether a given finite clone generated by finite...

Computational Complexity of k-Block Conjugacy

We consider several computational problems related to conjugacy between ...

The Subpower Membership Problem for Finite Algebras with Cube Terms

The subalgebra membership problem is the problem of deciding if a given ...

The local-global property for G-invariant terms

For some Maltsev conditions Σ it is enough to check if a finite algebra ...