AbstractWe 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
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),...
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...
We study certain constraint satisfaction problems which are the problems of deciding whether there e...
AbstractWe study non-uniform constraint satisfaction problems definable in monadic Datalog stratifie...
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 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...
AbstractWe study non-uniform constraint satisfaction problems definable in monadic Datalog stratifie...
AbstractIt is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynom...
We give a complexity theoretic classification of homomorphism problems for graphs and, more generall...
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),...
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...
We study certain constraint satisfaction problems which are the problems of deciding whether there e...
AbstractWe study non-uniform constraint satisfaction problems definable in monadic Datalog stratifie...
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 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...
AbstractWe study non-uniform constraint satisfaction problems definable in monadic Datalog stratifie...
AbstractIt is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynom...
We give a complexity theoretic classification of homomorphism problems for graphs and, more generall...
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),...
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),...