Project description
Tackling complexity in computing polynomials
The complexity of computing and manipulating polynomials lies at the heart of some of the most profound challenges in theoretical computer science. Questions such as determining the total weight of perfect matchings in a graph, developing efficient deterministic algorithms, or understanding the complexity of approximations highlight fundamental issues spanning algebraic complexity, geometric complexity theory and quantum information. In this context, the ERC-funded EACTP project seeks to address these challenges by advancing methods to tackle questions like polynomial identity testing, the symbolic rank of matrices and tensor subrank in quantum states. Building on recent breakthroughs in algebraic computation, the project aims to deliver transformative solutions to these challenges, paving the way for significant progress in computer science and mathematics.
Objective
This research proposal will address fundamental problems concerning the complexity of computing
and manipulating polynomials. For example, consider the following questions:
1. What is the complexity of computing the total weight of perfect matchings of a weighted graph?
2. Is there an efficient deterministic parallel algorithm that determines whether a graph has a perfect matching?
3. Is approximation much easier than exact computation?
4. How many EPR pairs can we distill from a given quantum state?
These seemingly unrelated questions represent some of the most important and challenging open problems in theoretical computer science: the first is the algebraic analog of the famous P vs. NP problem. The second question amounts to asking whether a symbolic matrix associated with the graph has full rank. Parallel randomized algorithms for computing this rank are known, but not deterministic ones. This is an instance of the polynomial identity testing (PIT) problem, the most fundamental algebraic derandomization problem. The third question asks about the relation between a complexity class and its closure, which lies at the heart of the Geometric Complexity Theory (GCT) program. The last question concerns the subrank of a tensor representing the given quantum state. Problems related to rank of tensors are at the heart of both algebraic complexity and quantum information theory.
Recent years have seen tremendous advance in our understanding of algebraic computations with new lower bounds, new PIT algorithms and with increasing connections to other branches of computer science and mathematics discovered. Results proved by the PI play an important role in all of these advances.
This project aims to study these and related problems and to develop new methods for solving them. Making progress on any of these problems will constitute a significant breakthrough.
Fields of science (EuroSciVoc)
CORDIS classifies projects with EuroSciVoc, a multilingual taxonomy of fields of science, through a semi-automatic process based on NLP techniques. See: The European Science Vocabulary.
This project's classification has been human-validated.
CORDIS classifies projects with EuroSciVoc, a multilingual taxonomy of fields of science, through a semi-automatic process based on NLP techniques. See: The European Science Vocabulary.
This project's classification has been human-validated.
Keywords
Project’s keywords as indicated by the project coordinator. Not to be confused with the EuroSciVoc taxonomy (Fields of science)
Project’s keywords as indicated by the project coordinator. Not to be confused with the EuroSciVoc taxonomy (Fields of science)
Programme(s)
Multi-annual funding programmes that define the EU’s priorities for research and innovation.
Multi-annual funding programmes that define the EU’s priorities for research and innovation.
-
HORIZON.1.1 - European Research Council (ERC)
MAIN PROGRAMME
See all projects funded under this programme
Topic(s)
Calls for proposals are divided into topics. A topic defines a specific subject or area for which applicants can submit proposals. The description of a topic comprises its specific scope and the expected impact of the funded project.
Calls for proposals are divided into topics. A topic defines a specific subject or area for which applicants can submit proposals. The description of a topic comprises its specific scope and the expected impact of the funded project.
Funding Scheme
Funding scheme (or “Type of Action”) inside a programme with common features. It specifies: the scope of what is funded; the reimbursement rate; specific evaluation criteria to qualify for funding; and the use of simplified forms of costs like lump sums.
Funding scheme (or “Type of Action”) inside a programme with common features. It specifies: the scope of what is funded; the reimbursement rate; specific evaluation criteria to qualify for funding; and the use of simplified forms of costs like lump sums.
HORIZON-ERC - HORIZON ERC Grants
See all projects funded under this funding scheme
Call for proposal
Procedure for inviting applicants to submit project proposals, with the aim of receiving EU funding.
Procedure for inviting applicants to submit project proposals, with the aim of receiving EU funding.
(opens in new window) ERC-2023-ADG
See all projects funded under this callHost institution
Net EU financial contribution. The sum of money that the participant receives, deducted by the EU contribution to its linked third party. It considers the distribution of the EU financial contribution between direct beneficiaries of the project and other types of participants, like third-party participants.
69978 Tel Aviv
Israel
The total costs incurred by this organisation to participate in the project, including direct and indirect costs. This amount is a subset of the overall project budget.