DeepAI

# 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 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.

• 5 publications
• 11 publications
• 2 publications
• 12 publications
02/14/2020

### 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...
03/14/2022

### Computational Complexity of Multi-Player Evolutionarily Stable Strategies

In this paper we study the computational complexity of computing an evol...
01/15/2023

### Deciding Equations in the Time Warp Algebra

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

### Existence of cube terms in finite finitely generated clones

We study the problem of whether a given finite clone generated by finite...
09/05/2019

### Computational Complexity of k-Block Conjugacy

We consider several computational problems related to conjugacy between ...
03/21/2018

### The Subpower Membership Problem for Finite Algebras with Cube Terms

The subalgebra membership problem is the problem of deciding if a given ...
09/05/2021

### The local-global property for G-invariant terms

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