project . 2019 - 2023 . On going

COCAN

Complexity and Condition in Algebra and Numerics
Open Access mandate for Publications European Commission
  • Funder: European CommissionProject code: 787840 Call for proposal: ERC-2017-ADG
  • Funded under: H2020 | ERC | ERC-ADG Overall Budget: 2,297,160 EURFunder Contribution: 2,297,160 EUR
  • Status: On going
  • Start Date
    01 Jan 2019
    End Date
    31 Dec 2023
  • Detailed project information (CORDIS)
  • Open Access mandate
    Research Data: No
Description
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 o...
Description
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 o...
Any information missing or wrong?Report an Issue