research
∙
10/18/2021
The complexity of the Quantified CSP having the polynomially generated powers property
It is known that if an algebra of polymorphisms of the constraint langua...
share
research
∙
09/16/2021
Small PCSPs that reduce to large CSPs
For relational structures A, B of the same signature, the Promise Constr...
research
∙
06/24/2021
The complexity of quantified constraints: collapsibility, switchability and the algebraic formulation
Let A be an idempotent algebra on a finite domain. By mediating between ...
research
∙
04/23/2021
Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP
This paper focuses on the algebraic theory underlying the study of the c...
research
∙
04/01/2021
The complete classification for quantified equality constraints
We prove that QCSP(ℕ;x=y→ y=z) is PSpace-complete, settling a question o...
research
∙
05/01/2020
Strong subalgebras and the Constraint Satisfaction Problem
In 2007 it was conjectured that the Constraint Satisfaction Problem (CSP...
research
∙
03/26/2020
No-Rainbow Problem and the Surjective Constraint Satisfaction Problem
Surjective Constraint Satisfaction Problem (SCSP) is the problem of deci...
research
∙
03/26/2020
No-Rainbow Problem is NP-Hard
Surjective Constraint Satisfaction Problem (SCSP) is the problem of deci...
research
∙
06/29/2019
QCSP monsters and the demise of the Chen Conjecture
We give a surprising classification for the computational complexity of ...
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
∙
01/02/2019
Deciding the existence of minority terms
This paper investigates the computational complexity of deciding if a gi...
research
∙
03/17/2018
