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 computational challenges of Constraint Satisfaction Problems (CSPs) by studying random instances and their structural properties. It aims to provide a rigorous understanding of the computational intractability of these problems, contributing to the field of theoretical computer science.
This is a project in the area of Theoretical Computer Science, particularly discrete algorithms and computational complexity.
Many Constraint Satisfaction Problems (`CSPs') such as Boolean satisfiability or graph coloring are well-known to be NP-hard, i.e., the worst-case computation time to solve these problems is exponential in the size of the problem instance.
To illuminate the conceptual origins of the computational hardness of these problems, a major research effort over the past 30 years h…
JOHANN WOLFGANG GOETHE-UNIVERSITAET FRANKFURT AM MAIN
Partner organizations (coordinator is shown above), with normalized type and CORDIS activity type. Guests see up to 4 partners.
United Kingdom, COVENTRY
Type: University / higher education
Activity type: Higher or Secondary Education Establishments
SME: No
Similar projects, consortium collaboration history, frequent partners, and OpenAlex research context.
Guests see up to 5 EuroSciVoc fields.
Guests see up to 5 topics.
