COMPLEXITY OF CSPS

Algorithms and Complexity of Constraint Satisfaction Problems

Coordinatore	Consorci Centre de Recerca Matematica    more  Organization address address: FACULTAD CIENCIES UAB APRATADO 50 city: BELLATERRA postcode: 8193 contact info Titolo: Ms. Nome: Ana Cognome: García-Donas Email: send email Telefono: 34935812953
Nazionalità Coordinatore	Spain [ES]
Totale costo	159˙865 €
EC contributo	159˙865 €
Programma	FP7-PEOPLE Specific programme "People" implementing the Seventh Framework Programme of the European Community for research, technological development and demonstration activities (2007 to 2013)
Code Call	FP7-PEOPLE-2010-IEF
Funding Scheme	MC-IEF
Anno di inizio	2011
Periodo (anno-mese-giorno)	2011-04-01   -   2012-03-31

 Partecipanti

#	participant	country	role	EC contrib. [€]
1	Consorci Centre de Recerca Matematica  Organization address address: FACULTAD CIENCIES UAB APRATADO 50 city: BELLATERRA postcode: 8193 contact info Titolo: Ms. Nome: Ana Cognome: García-Donas Email: send email Telefono: 34935812953	ES (BELLATERRA)	coordinator	159˙865.60

Mappa

 Word cloud

Esplora la "nuvola delle parole (Word Cloud) per avere un'idea di massima del progetto.

 Obiettivo del progetto (Objective)

'Constraint satisfaction problems (CSP) form a general framework that captures a large variety of algorithmic problems. Due to their generality, CSPs are ubiquitous in several areas such as, for example, artificial intelligence, database theory and statistical physics. Therefore it is not surprising that their study is of prominent importance also in computational complexity theory. The proposed research aims at studying algorithmic issues related to CSPs from the perspective of computational complexity. The project consists of two parts.

Firstly, we intend to widen the current understanding of algorithmic approaches to solving CSPs with a particular focus on the propositional satisfiability problem SAT. Recent years have seen an immense increase in the efficiency of practical algorithms solving the propositional satisfiability problem - so-called SAT solvers. Today we still do only have a limited understanding of the reasons for this increase. We will study these reasons. This will, among other things, include studying structural restrictions of input formulas which are likely to be relevant in practice. Along similar lines we will also examine the capabilities of other algorithmic approaches which are applicable to CSPs in general.

Secondly, we will study weighted extensions of CSPs from a structural point of view. Over the past few years, these versions of CSPs have received increased attention in the context of counting complexity. A main motivation for studying them arises from their connection to so-called spin glass models from statistical physics. Although we have a quite good understanding of the complexity of exactly computing them, we still have only little knowledge of the extent to which these weighted versions of CSPs can be approximated efficiently. The research project aims at extending this knowledge significantly.'