DFU, Volume 7, The Constraint Satisfaction Problem: Complexity and Approximability, Complete Volum
Many mathematical and practical problems can be expressed as constraint satisfaction problems (CSPs)...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
AbstractThe general intractability of the constraint satisfaction problem (CSP) has motivated the st...
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...
Mackworth, A.K. and E.C. Freuder, The complexity of constraint satisfaction revisited
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...
From 25th to 30th October 2009, the Dagstuhl Seminar 09441 ``The Constraint Satisfaction Problem: Co...
* INRA, centre de Toulouse Diffusion du document : INRA, centre de ToulouseInternational audienc
This article surveys recent advances in applying algebraic techniques to constraint satisfaction pro...
From 01.10.06 to 06.10.06, the Dagstuhl Seminar 06401 ``Complexity of Constraints\u27\u27 was held i...
SIGLEAvailable from British Library Document Supply Centre- DSC:9109.3968(EU-DCS-CSM--142) / BLDSC -...
We survey recent results on the broad family of problems that can be cast as valued constraint satis...
International audienceEven though the Constraint Satisfaction Problem (CSP) is NP-complete, many tra...
Many mathematical and practical problems can be expressed as constraint satisfaction problems (CSPs)...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
AbstractThe general intractability of the constraint satisfaction problem (CSP) has motivated the st...
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...
Mackworth, A.K. and E.C. Freuder, The complexity of constraint satisfaction revisited
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...
From 25th to 30th October 2009, the Dagstuhl Seminar 09441 ``The Constraint Satisfaction Problem: Co...
* INRA, centre de Toulouse Diffusion du document : INRA, centre de ToulouseInternational audienc
This article surveys recent advances in applying algebraic techniques to constraint satisfaction pro...
From 01.10.06 to 06.10.06, the Dagstuhl Seminar 06401 ``Complexity of Constraints\u27\u27 was held i...
SIGLEAvailable from British Library Document Supply Centre- DSC:9109.3968(EU-DCS-CSM--142) / BLDSC -...
We survey recent results on the broad family of problems that can be cast as valued constraint satis...
International audienceEven though the Constraint Satisfaction Problem (CSP) is NP-complete, many tra...
Many mathematical and practical problems can be expressed as constraint satisfaction problems (CSPs)...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
AbstractThe general intractability of the constraint satisfaction problem (CSP) has motivated the st...
DOI
Add to ORKG