19 citations · 23 across the 6 of their papers we have counts for
8 papers
Maltsev Constraint Satisfaction Problems and Deterministic Logspace With Counting
Dejan Delic, Ali Syed
In this article, we prove that the problem of solving , where is a finite relational template which admits a Maltsev polymorphism is in…
The Constraint Satisfaction Problem Over Multisorted Cores
Dejan Delic, John Marcoux
Constraint Satisfaction Problems (CSPs, for short) make up a class of problems with applications in many areas of computer science. The first classification of these problems was g…
A new algorithm for constraint satisfaction problems with few subpowers templates
Dejan Delic, Amir El-Aooiti
In this article, we provide a new algorithm for solving constraint satisfaction problems over templates with few subpowers, by reducing the problem to the combination of solvabilit…
A new algorithm for constraint satisfaction problems with Maltsev templates
Dejan Delic, Aklilu Habte
In this article, we provide a new algorithm for solving constraint satisfaction problems with Maltsev constraints, based on the new notion of Maltsev consistency.
Constraint Satisfaction Problem Dichotomy for Finite Templates: a Proof Via Consistency Checks
Dejan Delić
One of the central problems in the study of parametrized constraint satisfaction problems is the Dichotomy Conjecture by T. Feder and M. Vardi stating that the constraint satisfact…
A finer reduction of constraint problems to digraphs
Jakub Bulín, Dejan Delic, Marcel Jackson +1
It is well known that the constraint satisfaction problem over a general relational structure A is polynomial time equivalent to the constraint problem over some associated digraph…