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

MCC

Financiado

Cerrado

Mapping the Complexity of Counting

"Just as advances in engineering rely on a deep foundational knowledge of physics, so too advances in algorithms and programming rely on a deep knowledge of the intrinsic nature of computation. Significant progress has been made,... ver más

28/02/2019

UOXF

2M€

Presupuesto del proyecto: 2M€

Líder del proyecto

THE CHANCELLOR MASTERS AND SCHOLARS OF THE UN... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

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 2019-02-28 No tenemos la información de la convocatoria

0% 100% 100%

Información adicional privada

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

1 Participantes

UOXF

0.00€ | Lider

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

CountHom Counting (with) homomorphisms 2M€ Cerrado

NACS New Approaches to Counting and Sampling 1M€ Cerrado

HOFGA The Hardness of Finding Good Algorithms 1M€ Cerrado

LBCAD Lower bounds for combinatorial algorithms and dynamic proble... 900K€ Cerrado

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

TCSTURKEY Analysis of Boolean Functions for Algorithms and Complexity 116K€ Cerrado

Líder del proyecto

THE CHANCELLOR MASTERS AND SCHOLARS OF THE UN... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 2M€

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

Descripción del proyecto "Just as advances in engineering rely on a deep foundational knowledge of physics, so too advances in algorithms and programming rely on a deep knowledge of the intrinsic nature of computation. Significant progress has been made, particularly in the field of computational complexity, which aims to discover which computational problems are feasible, which are inherently infeasible, and why. However, huge theoretical challenges remain: many problem classes are poorly understood, including those containing problems arising in practical applications. The MCC project will enable significant computational advances in a host of application areas through the development of a comprehensive theory of counting problems. These problems, which involve the computation of weighted sums, are common and important, arising in practical applications from diverse fields including statistics, statistical physics, information theory, coding, and machine learning. Thus, it is of fundamental importance to understand their complexity. We propose a coherent and systematic study of the complexity of counting problems. A sequence of exciting recent developments, pioneered by the PI and others, makes it plausible that we now have the tools needed to make substantial progress. The overall objectives of MCC are (1) Map out the landscape of computational counting problems (exact and approximate), determining which problems are tractable, and which are intractable (quantifying the extent of tractability), and (2) Develop complexity characterisations elucidating the features that make counting problems tractable or intractable, not only discovering which problems are tractable, but also discovering a characterisation telling us why. The project encompasses a large range of wide-open problems. However, the strength of the PI, the scale of the project, the timeliness of the project (given recent results), and the novel methods proposed make it certain that the research will produce breakthroughs."

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores