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

Algacom

Financiado

Algorithms and Game Comonads

Our modern society is driven by computers, digital services, and algorithms. Understanding their weaknesses and limitations is one of the main subjects of study of theoretical computer science. Probably the most studied aspect of... ver más

31/08/2026

CVUT

166K€

Presupuesto del proyecto: 166K€

Líder del proyecto

CESKE VYSOKE UCENI TECHNICKE V PRAZE No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Financiación concedida El organismo HORIZON EUROPE notifico la concesión del proyecto el día 2023-12-04

HORIZON-MSCA-2022-PF-01-01: MSCA Postdoctoral Fellowships 2022 ExpectedOutcome:

I+D

Cerrada hace 2 años

0% 100%

1 Participantes

CVUT

166.28K€ | 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

CRACKNP Finding Cracks in the Wall of NP completeness 1M€ Cerrado

EXCICO Extremal Combinatorics and Circuit Complexity 180K€ Cerrado

PACKENUM PArameterized Complexity and Kernelization for ENUMeration 141K€ Cerrado

NoShortProof Nonexistence of Short Proofs 231K€ Cerrado

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

IJC2018-035334-I Teoría de la Computación - Complejidad Computacional 93K€ Cerrado

Duración del proyecto: 32 meses Fecha Inicio: 2023-12-04
Fecha Fin: 2026-08-31

Líder del proyecto

CESKE VYSOKE UCENI TECHNICKE V PRAZE No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 166K€

Descripción del proyecto Our modern society is driven by computers, digital services, and algorithms. Understanding their weaknesses and limitations is one of the main subjects of study of theoretical computer science. Probably the most studied aspect of algorithms is their efficiency of use of computational resources, embodied as the running time of an algorithm. Parameterised complexity is a branch of theoretical computer science interested in determining whether there exists an efficient algorithm that solves a given computational problem. The efficiency is determined based on the structure of the input data. The main limitation of parameterised complexity is that these analyses of computational problems are done on a case-by-case basis. This means that if somebody changes the problem or its parameterisation ever so slightly, the whole analysis has to be redone from scratch. To tackle this problem we propose to use game comonads, a novel structural approach to logic in computer science. The theory of game comonads draws its strength from category theory, a well-established discipline of mathematics which specialises on compositionality, reusability of its tools and high-level of abstraction. Game comonads, despite being relatively new, have already shown to be a useful tool in the study of finite model theory, which is an adjacent area of study of parameterised complexity. The primary goal of this project is to bring compositional tools of category theory into the setting of algorithms, with game comonads acting as the connecting glue. This project bring together expertise in category theory, in the form of the applicant and expertise in parameterised complexity, in the form of the host institution and the supervisor who will devote their efforts into bridging the gap between the two thus-far mostly disjoint disciplines of computer science and mathematics.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores