research
∙
05/03/2023
Short definitions in constraint languages
A first-order formula is called primitive positive (pp) if it only admit...
share
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
∙
05/03/2021
CSAT and CEQV for nilpotent Maltsev algebras of Fitting length > 2
The circuit satisfaction problem CSAT(A) of an algebra A is the problem ...
research
∙
02/17/2020
When symmetries are not enough: a hierarchy of hard Constraint Satisfaction Problems
We produce a class of ω-categorical structures with finite signature by ...
research
∙
11/04/2019
CC-circuits and the expressive power of nilpotent algebras
We show that CC-circuits of bounded depth have the same expressive power...
research
∙
09/26/2019
Circuit equivalence in 2-nilpotent algebras
The circuit equivalence problem of a finite algebra A is the computation...
research
∙
08/15/2018