CORDIS Project
Funding breakdown and partner intelligence are Premium
Sign in and upgrade to Premium for EU contribution totals, consortium analytics, OpenAlex research context, and AI summaries. · 0 consortium intelligence fields visible of 1
Start free • Cancel anytime • 14-day refund guarantee
This project investigates the properties of infinite definable graphs and their relationship with finite structures, focusing on complexity in constraint satisfaction problems and distributed computing models. It aims to enhance understanding of complexity hierarchies and develop new examples in descriptive combinatori…
We propose to study infinite, definable (Borel, measurable, etc.) graphs and structures and their interplay with finite ones from the perspective of descriptive complexity.
Our focus will be on the following three directions:-Determining the descriptive complexity of constraint satisfaction problems (CSPs), or, equivalently, homomorphism problems on infinite domains. -Analyzing the concept of Borel hyperfiniteness of graphs and establishing new examples of non-hyperfinite graphs using methods fr…
EOTVOS LORAND TUDOMANYEGYETEM
Partner organizations (coordinator is shown above), with normalized type and CORDIS activity type. Guests see up to 4 partners.
Similar projects, consortium collaboration history, frequent partners, and OpenAlex research context.
Guests see up to 5 EuroSciVoc fields.
Guests see up to 5 topics.
Guests see up to 5 keywords.
