Deciding the existence of minority terms

01/02/2019
by   Alexandr Kazda, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
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...
research
07/15/2023

Deciding One to One property of Boolean maps: Condition and algorithm in terms of implicants

This paper addresses the computational problem of deciding invertibility...
research
09/05/2019

Computational Complexity of k-Block Conjugacy

We consider several computational problems related to conjugacy between ...
research
01/15/2023

Deciding Equations in the Time Warp Algebra

Join-preserving maps on the discrete time scale ω^+, referred to as time...
research
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...
research
09/05/2021

The local-global property for G-invariant terms

For some Maltsev conditions Σ it is enough to check if a finite algebra ...
research
10/04/2021

Learning to shortcut and shortlist order fulfillment deciding

With the increase of order fulfillment options and business objectives t...

Please sign up or login with your details

Forgot password? Click here to reset