COCAN SIGNED
Complexity and Condition in Algebra and Numerics
Total Cost €
0EC-Contrib. €
0Partnership
0Views
0COCAN project word cloud
Explore the words cloud of the COCAN project. It provides you a very rough idea of what is the project "COCAN" about.
Project "COCAN" data sheet
The following table provides information about the project.
| Coordinator |
TECHNISCHE UNIVERSITAT BERLIN
Organization address contact info |
| Coordinator Country | Germany [DE] |
| Total cost | 2˙297˙163 € |
| EC max contribution | 2˙297˙163 € (100%) |
| Programme |
1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC)) |
| Code Call | ERC-2017-ADG |
| Funding Scheme | ERC-ADG |
| Starting year | 2019 |
| Duration (year-month-day) | from 2019-01-01 to 2023-12-31 |
Partnership
Take a look of project's partnership.
| # | ||||
|---|---|---|---|---|
| 1 | TECHNISCHE UNIVERSITAT BERLIN | DE (BERLIN) | coordinator | 2˙297˙163.00 |
Map
Project objective
'This proposal connects three areas that are considered distant from each other: computational complexity, algebraic geometry, and numerics. In the last decade, it became clear that the fundamental questions of computational complexity (P vs NP) should be studied in algebraic settings, linking them to problems in algebraic geometry. Recent progress on this challenging and very difficult questions led to surprising progress in computational invariant theory, which we want to explore thoroughly. We expect this to lead to solutions of computational problems in invariant theory that currently are considered infeasible. The complexity of Hilbert's null cone (the set of 'singular objects') appears of paramount importance here. These investigations will also shed new light on the foundational questions of algebraic complexity theory. As an essential new ingredient to achieve this, we will tackle the arising algebraic computational problems by means of approximate numeric computations, taking into account the concept of numerical condition.
A related goal of the proposal is to develop a theory of efficient and numerically stable algorithms in algebraic geometry that reflects the properties of structured systems of polynomial equations, possibly with singularities. While there are various heuristics, a satisfactory theory so far only exists for unstructured systems over the complex numbers (recent solution of Smale's 17th problem), which seriously limits its range of applications. In this framework, the quality of numerical algorithms is gauged by a probabilistic analysis that shows small average (or smoothed) running time. One of the main challenges here consists of a probabilistic study of random structured polynomial systems. We will also develop and analyze numerical algorithms for finding or describing the set of real solutions, e.g., in terms of their homology. '
Are you the coordinator (or a participant) of this project? Plaese send me more information about the "COCAN" 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 (fabio@fabiodisconzi.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 "COCAN" are provided by the European Opendata Portal: CORDIS opendata.