We study certain constraint satisfaction problems which are the problems of deciding whether there exists a homomorphism from a given relational structure to a fixed structure with a majority polymorphism. We show that such a problem is equivalent to deciding whether the given structure admits a homomorphism from an obstruction belonging to a certain class of structures of bounded pathwidth. This implies that the constraint satisfaction problem for any fixed structure with a majority polymorphism is in NL
AbstractA majority function is a ternary near-unanimity function. Dalmau and Krokhin have recently s...
For a finite relational structure A, the Constraint Satisfaction Problem with template A, or CSP(A),...
For a finite relational structure A, the Constraint Satisfaction Problem with template A, or CSP(A),...
We study certain constraint satisfaction problems which are the problems of deciding whether there e...
We study certain constraint satisfaction problems which are the problems of deciding whether there e...
AbstractWe study certain constraint satisfaction problems which are the problems of deciding whether...
Abstract. In a nutshell, a duality for a constraint satisfaction problem equates the existence of on...
AbstractA majority function is a ternary near-unanimity function. Dalmau and Krokhin have recently s...
We give a complexity theoretic classification of homomorphism problems for graphs and, more generall...
AbstractWe study non-uniform constraint satisfaction problems definable in monadic Datalog stratifie...
The thesis consists of a collection of my contributions to universal algebra. Motivated by the Const...
AbstractWe prove that when a digraph G has a Maltsev polymorphism, then G also has a majority polymo...
Abstract. We study the complexity of structurally restricted homomorphism and constraint satisfactio...
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the...
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the...
AbstractA majority function is a ternary near-unanimity function. Dalmau and Krokhin have recently s...
For a finite relational structure A, the Constraint Satisfaction Problem with template A, or CSP(A),...
For a finite relational structure A, the Constraint Satisfaction Problem with template A, or CSP(A),...
We study certain constraint satisfaction problems which are the problems of deciding whether there e...
We study certain constraint satisfaction problems which are the problems of deciding whether there e...
AbstractWe study certain constraint satisfaction problems which are the problems of deciding whether...
Abstract. In a nutshell, a duality for a constraint satisfaction problem equates the existence of on...
AbstractA majority function is a ternary near-unanimity function. Dalmau and Krokhin have recently s...
We give a complexity theoretic classification of homomorphism problems for graphs and, more generall...
AbstractWe study non-uniform constraint satisfaction problems definable in monadic Datalog stratifie...
The thesis consists of a collection of my contributions to universal algebra. Motivated by the Const...
AbstractWe prove that when a digraph G has a Maltsev polymorphism, then G also has a majority polymo...
Abstract. We study the complexity of structurally restricted homomorphism and constraint satisfactio...
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the...
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the...
AbstractA majority function is a ternary near-unanimity function. Dalmau and Krokhin have recently s...
For a finite relational structure A, the Constraint Satisfaction Problem with template A, or CSP(A),...
For a finite relational structure A, the Constraint Satisfaction Problem with template A, or CSP(A),...