Explore the words cloud of the AUTAR project. It provides you a very rough idea of what is the project "AUTAR" about.
The following table provides information about the project.
UNIVERSITAT POLITECNICA DE CATALUNYA
|Coordinator Country||Spain [ES]|
|Total cost||1˙725˙656 €|
|EC max contribution||1˙725˙656 € (100%)|
1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC))
|Duration (year-month-day)||from 2015-06-01 to 2020-05-31|
Take a look of project's partnership.
|1||UNIVERSITAT POLITECNICA DE CATALUNYA||ES (BARCELONA)||coordinator||1˙725˙656.00|
For a large family of computational problems collectively known as constrained optimization and satisfaction problems (CSPs), four decades of research in algorithms and computational complexity have led to a theory that tries to classify them as algorithmically tractable vs. intractable, i.e. polynomial-time solvable vs. NP-hard. However, there remains an important gap in our knowledge in that many CSPs of interest resist classification by this theory. Some such problems of practical relevance include fundamental partition problems in graph theory, isomorphism problems in combinatorics, and strategy-design problems in mathematical game theory. To tackle this gap in our knowledge, the research of the last decade has been driven either by finding hard instances for algorithms that solve tighter and tighter relaxations of the original problem, or by formulating new hardness-hypotheses that are stronger but admittedly less robust than NP-hardness.
The ultimate goal of this project is closing the gap between the partial progress that these approaches represent and the original classification project into tractable vs. intractable problems. Our thesis is that the field has reached a point where, in many cases of interest, the analysis of the current candidate algorithms that appear to solve all instances could suffice to classify the problem one way or the other, without the need for alternative hardness-hypotheses. The novelty in our approach is a program to develop our recent discovery that, in some cases of interest, two methods from different areas match in strength: indistinguishability pebble games from mathematical logic, and hierarchies of convex relaxations from mathematical programming. Thus, we aim at making significant advances in the status of important algorithmic problems by looking for a general theory that unifies and goes beyond the current understanding of its components.
|year||authors and title||journal||last update|
Gogacz, Tomasz, Torunczyk, Szymon
Entropy Bounds for Conjunctive Queries with Functional Dependencies
published pages: 15:1--15:17, ISSN: , DOI: 10.4230/LIPIcs.ICDT.2017.15
|20th International Conference on Database Theory (ICDT 2017) LIPIcs 68||2020-04-23|
Are you the coordinator (or a participant) of this project? Plaese send me more information about the "AUTAR" project.
For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.
Send me an email (email@example.com) and I put them in your project's page as son as possible.
Thanks. And then put a link of this page into your project's website.
The information about "AUTAR" are provided by the European Opendata Portal: CORDIS opendata.