AbstractThe general intractability of the constraint satisfaction problem (CSP) has motivated the study of the complexity of restricted cases of this problem. Thus far, the literature has primarily considered the formulation of the CSP where constraint relations are given explicitly. We initiate the systematic study of CSP complexity with succinctly specified constraint relations
Constraint Satisfaction Problems (CSPs) are a class of decision problems where one usually fixes a s...
International audienceEven though the Constraint Satisfaction Problem (CSP) is NP-complete, many tra...
The constraint satisfaction problem (CSP) is a broad framework capturing many combinatorial search ...
The general intractability of the constraint satisfaction problem has motivated the study of the com...
The general intractability of the constraint satisfaction problem has motivated the study of the com...
AbstractThe general intractability of the constraint satisfaction problem (CSP) has motivated the st...
In the constraint satisfaction problem (CSP) corresponding to a constraint language (i.e., a set of ...
Constraint satisfaction has always played a central role in computational complexity theory; appropr...
In the constraint satisfaction problem (CSP) corresponding to a constraint language (i.e., a set of ...
Constraint satisfaction has always played a central role in computational complexity theory; appropr...
International audienceThe computational complexity of the constraint satisfaction problem (CSP) with...
During the past two decades, an impressive array of diverse methods from several different mathemati...
During the past two decades, an impressive array of diverse methods from several different mathemati...
The constraint satisfaction problem (CSP) comprises n variables with associated finite domains (with...
Abstract. Complete algorithms for constraint solving typically exploit properties like (in)consisten...
Constraint Satisfaction Problems (CSPs) are a class of decision problems where one usually fixes a s...
International audienceEven though the Constraint Satisfaction Problem (CSP) is NP-complete, many tra...
The constraint satisfaction problem (CSP) is a broad framework capturing many combinatorial search ...
The general intractability of the constraint satisfaction problem has motivated the study of the com...
The general intractability of the constraint satisfaction problem has motivated the study of the com...
AbstractThe general intractability of the constraint satisfaction problem (CSP) has motivated the st...
In the constraint satisfaction problem (CSP) corresponding to a constraint language (i.e., a set of ...
Constraint satisfaction has always played a central role in computational complexity theory; appropr...
In the constraint satisfaction problem (CSP) corresponding to a constraint language (i.e., a set of ...
Constraint satisfaction has always played a central role in computational complexity theory; appropr...
International audienceThe computational complexity of the constraint satisfaction problem (CSP) with...
During the past two decades, an impressive array of diverse methods from several different mathemati...
During the past two decades, an impressive array of diverse methods from several different mathemati...
The constraint satisfaction problem (CSP) comprises n variables with associated finite domains (with...
Abstract. Complete algorithms for constraint solving typically exploit properties like (in)consisten...
Constraint Satisfaction Problems (CSPs) are a class of decision problems where one usually fixes a s...
International audienceEven though the Constraint Satisfaction Problem (CSP) is NP-complete, many tra...
The constraint satisfaction problem (CSP) is a broad framework capturing many combinatorial search ...
DOI
Add to ORKG