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

CoCoSym

Financiado

Symmetry in Computational Complexity

The last 20 years of rapid development in the computational-theoretic aspects of the fixed-language Constraint Satisfaction Problems (CSPs) has been fueled by a connection between the complexity and a certain concept capturing sym... ver más

31/01/2023

1M€

Presupuesto del proyecto: 1M€

Líder del proyecto

UNIVERZITA KARLOVA No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Ver 2 Participantes

Financiación concedida El organismo H2020 notifico la concesión del proyecto el día 2023-01-31

ERC-2017-COG: ERC Consolidator Grant

I+D

Cerrada hace 7 años

0% 100% 100%

Información adicional privada

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

2 Participantes

1.21M€ | Lider

ENTRECHEM

400.00K€ | Participante

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

Proyectos interesantes

CONJEXITY Investigating the Conjectures of Fine-Grained Complexity 1M€ Cerrado

EPRICOT Efficient Proofs and Computation A Unified Algebraic Appro... 2M€ Cerrado

PID2019-109137GB-C22 SISTEMAS DE PRUEBA MAS ALLA DE RESOLUCION: ANALISIS TEORICO 37K€ Cerrado

EXCICO Extremal Combinatorics and Circuit Complexity 180K€ Cerrado

NEAT Non-linear Existential Arithmetic Theories 181K€ Cerrado

POCOCOP Polynomial-time Computation: Opening the Blackboxes in Const... 8M€ Cerrado

Duración del proyecto: 60 meses Fecha Inicio: 2018-01-17
Fecha Fin: 2023-01-31

Líder del proyecto

UNIVERZITA KARLOVA No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 1M€

Descripción del proyecto The last 20 years of rapid development in the computational-theoretic aspects of the fixed-language Constraint Satisfaction Problems (CSPs) has been fueled by a connection between the complexity and a certain concept capturing symmetry of computational problems in this class. My vision is that this connection will eventually evolve into the organizing principle of computational complexity and will lead to solutions of fundamental problems such as the Unique Games Conjecture or even the P-versus-NP problem. In order to break through the current limits of this algebraic approach, I will concentrate on specific goals designed to (A) discover suitable objects capturing symmetry that reflect the complexity in problem classes, where such an object is not known yet; (B) make the natural ordering of symmetries coarser so that it reflects the complexity more faithfully; (C) delineate the borderline between computationally hard and easy problems; (D) strengthen characterizations of existing borderlines to increase their usefulness as tools for proving hardness and designing efficient algorithm; and (E) design efficient algorithms based on direct and indirect uses of symmetries. The specific goals concern the fixed-language CSP over finite relational structures and its generalizations to infinite domains (iCSP) and weighted relations (vCSP), in which the algebraic theory is highly developed and the limitations are clearly visible. The approach is based on joining the forces of the universal algebraic methods in finite domains, model-theoretical and topological methods in the iCSP, and analytical and probabilistic methods in the vCSP. The starting point is to generalize and improve the Absorption Theory from finite domains.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores