Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

Complexity of CSPs

Financiado

Cerrado

Algorithms and Complexity of Constraint Satisfaction Problems

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, da... ver más

31/03/2012

CONSORCI CENTRE DE...

160K€

Presupuesto del proyecto: 160K€

Líder del proyecto

CONSORCI CENTRE DE RECERCA MATEMATICA Otra investigación y desarrollo experimental en ciencias naturales y técnicas otros tipos

TRL 4-5 | 50K€

Fecha límite participación Sin fecha límite de participación.

Financiación concedida El organismo FP7 notifico la concesión del proyecto el día 2012-03-31 No tenemos la información de la convocatoria

0% 100%

Información adicional privada

No hay información privada compartida para este proyecto. Habla con el coordinador.

1 Participantes

CONSORCI CENTRE DE RECERCA M...

0.00€ | Lider

Proyectos interesantes

TIN2010-20967-C04-01

Software

Data Science

37K€ Cerrado

TIN2010-20967-C04-02

Software

Data Science

10K€ Cerrado

TIN2010-20967-C04-04

Software

Data Science

16K€ Cerrado

TIN2010-20967-C04-03

Software

Data Science

77K€ Cerrado

TIN2013-48031-C4-1-P

Software

Data Science

53K€ Cerrado

TIN2013-48031-C4-4-P

Software

Data Science

31K€ Cerrado

Conecta tu I+D

¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video

Líder del proyecto

CONSORCI CENTRE DE RECERCA MATEMATICA Otra investigación y desarrollo experimental en ciencias naturales y técnicas otros tipos

TRL 4-5 | 50K€

Presupuesto del proyecto 160K€

Fecha límite de participación Sin fecha límite de participación.

Descripción del proyecto 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.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores