Service Communautaire d'Information sur la Recherche et le Développement - CORDIS

ERC

CSP-COMPLEXITY Résumé de rapport

Project ID: 257039
Financé au titre de: FP7-IDEAS-ERC
Pays: Germany

Final Report Summary - CSP-COMPLEXITY (Constraint Satisfaction Problems: Algorithms and Complexity)

Constraint Satisfaction Problems are computational problems that appear in many areas of computer science, for example in optimization, scheduling, database theory, and knowledge representation. The project CSP-Complexity explored the computational complexity of constraint satisfaction problems: in particular the question which CSPs are polynomial-time tractable. It was already known that classifying the complexity of CSPs is closely related to central questions in universal algebra. One of the outcomes of the project is that universal algebra can also be used when the constraint satisfaction problems are over infinite domains, using concepts and results from model theory and Ramsey theory. This led to several powerful classification results for CSPs over infinite domains, but also to new research directions in the mathematical fields mentioned above.

Contact

Bertram Skibinski, (Project Manager)
Tél.: +49 351 463 42191
Fax: +49 351 463 39742
E-mail
Numéro d'enregistrement: 183485 / Dernière mise à jour le: 2016-06-07
Source d'information: SESAM