ERC Consolidator Grant · 2024
Search tasks are computational tasks with a curious property: while their solutions are easily verifiable when given, finding those solutions from scratch appears much more arduous. A central algorithmic paradigm to solve such tasks is that of search space decomposition. This paradigm solves a search task by breaking it up in subtasks such that a solution to the original problem can be quickly recovered from solutions of the subtasks. Despite its basic nature and its ubiquitous use, it still holds many mysteries. The mission of COALESCE is to develop a broad theory to design and analyze search space decompositions to solve fundamental search tasks as fast as possible in the standard model…
From the public funding record at EU CORDIS. Describes the funded project, not the reviews below.