From 01.10.06 to 06.10.06, the Dagstuhl Seminar 06401 ``Complexity of Constraints\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available
The tractability conjecture for constraint satisfaction problems (CSPs) describes the constraint la...
Constraint Satisfaction Problems (CSPs) are a class of decision problems where one usually fixes a s...
An instance of the Constraint Satisfaction Problem (CSP) is given by a finite set of variables, a fi...
From 01.10.06 to 06.10.06, the Dagstuhl Seminar 06401 ``Complexity of Constraints\u27\u27 was held i...
From 25th to 30th October 2009, the Dagstuhl Seminar 09441 ``The Constraint Satisfaction Problem: Co...
From 25th to 30th October 2009, the Dagstuhl Seminar 09441 ``The Constraint Satisfaction Problem: Co...
During the past two decades, an impressive array of diverse methods from several different mathemati...
Constraint satisfaction has always played a central role in computational complexity theory; appropr...
During the past two decades, an impressive array of diverse methods from several different mathemati...
Constraint satisfaction has always played a central role in computational complexity theory; appropr...
A large class of problems in AI and other areas of computer science can be viewed as constraint-sati...
From 24.07.05 to 29.07.05, the Dagstuhl Seminar 05301 ``Exact Algorithms and Fixed-Parameter Tractab...
Mackworth, A.K. and E.C. Freuder, The complexity of constraint satisfaction revisited
From 24.07.05 to 29.07.05, the Dagstuhl Seminar 05301 ``Exact Algorithms and Fixed-Parameter Tractab...
We survey recent results on the broad family of problems that can be cast as valued constraint satis...
The tractability conjecture for constraint satisfaction problems (CSPs) describes the constraint la...
Constraint Satisfaction Problems (CSPs) are a class of decision problems where one usually fixes a s...
An instance of the Constraint Satisfaction Problem (CSP) is given by a finite set of variables, a fi...
From 01.10.06 to 06.10.06, the Dagstuhl Seminar 06401 ``Complexity of Constraints\u27\u27 was held i...
From 25th to 30th October 2009, the Dagstuhl Seminar 09441 ``The Constraint Satisfaction Problem: Co...
From 25th to 30th October 2009, the Dagstuhl Seminar 09441 ``The Constraint Satisfaction Problem: Co...
During the past two decades, an impressive array of diverse methods from several different mathemati...
Constraint satisfaction has always played a central role in computational complexity theory; appropr...
During the past two decades, an impressive array of diverse methods from several different mathemati...
Constraint satisfaction has always played a central role in computational complexity theory; appropr...
A large class of problems in AI and other areas of computer science can be viewed as constraint-sati...
From 24.07.05 to 29.07.05, the Dagstuhl Seminar 05301 ``Exact Algorithms and Fixed-Parameter Tractab...
Mackworth, A.K. and E.C. Freuder, The complexity of constraint satisfaction revisited
From 24.07.05 to 29.07.05, the Dagstuhl Seminar 05301 ``Exact Algorithms and Fixed-Parameter Tractab...
We survey recent results on the broad family of problems that can be cast as valued constraint satis...
The tractability conjecture for constraint satisfaction problems (CSPs) describes the constraint la...
Constraint Satisfaction Problems (CSPs) are a class of decision problems where one usually fixes a s...
An instance of the Constraint Satisfaction Problem (CSP) is given by a finite set of variables, a fi...