24 citations · 51 across the 16 of their papers we have counts for
19 papers
The Rise of Plurimorphisms: Algebraic Approach to Approximation
Libor Barto, Silvia Butti, Alexandr Kazda +2
Following the success of the so-called algebraic approach to the study of decision constraint satisfaction problems (CSPs), exact optimization of valued CSPs, and most recently pro…
The local-global property for G-invariant terms
Alexandr Kazda, Michael Kompatscher
For some Maltsev conditions it is enough to check if a finite algebra satisfies locally on subsets of bounded size, in order to decide, whether sati…
Small Promise CSPs that reduce to large CSPs
Alexandr Kazda, Peter Mayr, Dmitriy Zhuk
For relational structures A, B of the same signature, the Promise Constraint Satisfaction Problem PCSP(A,B) asks whether a given input structure maps homomorphically to A or does n…
Deciding the existence of quasi weak near unanimity terms in finite algebras
Alexandr Kazda
We show that for a fixed positive integer k one can efficiently decide if a finite algebra A admits a k-ary weak near unanimity operation by looking at the local behavior of the te…
Existence of cube terms in finite algebras
Alexandr Kazda, Dmitriy Zhuk
We study the problem of whether a given finite algebra with finitely many basic operations contains a cube term; we give both structural and algorithmic results. We show that if su…
Deciding the existence of minority terms
Alexandr Kazda, Jakub Opršal, Matt Valeriote +1
This paper investigates the computational complexity of deciding if a given finite idempotent algebra has a ternary term operation that satisfies the minority equations $m(y,x,…