LBITAC
Lower Bounds and Identity Testing for Arithmetic Circuits
| Coordinatore | TEL AVIV UNIVERSITY
Spiacenti, non ci sono informazioni su questo coordinatore. Contattare Fabio per maggiori infomrazioni, grazie. |
| Nazionalità Coordinatore | Israel [IL] |
| Totale costo | 1˙427˙485 € |
| EC contributo | 1˙427˙485 € |
| Programma | FP7-IDEAS-ERC
Specific programme: "Ideas" implementing the Seventh Framework Programme of the European Community for research, technological development and demonstration activities (2007 to 2013) |
| Code Call | ERC-2010-StG_20091028 |
| Funding Scheme | ERC-SG |
| Anno di inizio | 2011 |
| Periodo (anno-mese-giorno) | 2011-03-01 - 2017-02-28 |
Partecipanti
| # | ||||
|---|---|---|---|---|
| 1 |
TECHNION - ISRAEL INSTITUTE OF TECHNOLOGY
Organization address
address: TECHNION CITY - SENATE BUILDING contact info |
IL (HAIFA) | beneficiary | 714˙651.42 |
| 2 |
TEL AVIV UNIVERSITY
Organization address
address: RAMAT AVIV contact info |
IL (TEL AVIV) | hostInstitution | 712˙833.58 |
| 3 |
TEL AVIV UNIVERSITY
Organization address
address: RAMAT AVIV contact info |
IL (TEL AVIV) | hostInstitution | 712˙833.58 |
Mappa
Word cloud
Esplora la "nuvola delle parole (Word Cloud) per avere un'idea di massima del progetto.
Obiettivo del progetto (Objective)
'The focus of our proposal is on arithmetic circuit complexity. Arithmetic circuits are the most common model for computing polynomials, over arbitrary fields. This model was studied by many researchers in the past 40 years but still not much is known on many of the basic problems concerning this model.
In this research we propose to study some of the most exciting fundamental open problems in theoretical computer science: Proving lower bounds on the size of arithmetic circuits and finding efficient deterministic algorithms for checking identity of arithmetic circuits. Proving a strong lower bound or finding efficient deterministic algorithms to the polynomial identity testing problem are the most important problems in algebraic complexity and solving either of them will be a dramatic breakthrough in theoretical computer science.
The two problems that we intend to study are closely related to each other - there are several known results showing that a solution to one of the problems may lead to a solution to the other. Thus, we propose to study strongly related problems that lie in the frontier of algebraic complexity. Any advance will be a significant contributions to the field of theoretical computer science.'