PAC

Proofs and Computation

 Coordinatore TECHNION - ISRAEL INSTITUTE OF TECHNOLOGY 

Spiacenti, non ci sono informazioni su questo coordinatore. Contattare Fabio per maggiori infomrazioni, grazie.

 Nazionalità Coordinatore Israel [IL]
 Totale costo 1˙743˙676 €
 EC contributo 1˙743˙676 €
 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-2009-StG
 Funding Scheme ERC-SG
 Anno di inizio 2009
 Periodo (anno-mese-giorno) 2009-12-01   -   2015-09-30

 Partecipanti

# participant  country  role  EC contrib. [€] 
1    TECHNION - ISRAEL INSTITUTE OF TECHNOLOGY

 Organization address address: TECHNION CITY - SENATE BUILDING
city: HAIFA
postcode: 32000

contact info
Titolo: Dr.
Nome: Eliyahu
Cognome: Ben Sasson
Email: send email
Telefono: +972 4 829 4892
Fax: +972 4 829 3900

IL (HAIFA) hostInstitution 1˙743˙676.00
2    TECHNION - ISRAEL INSTITUTE OF TECHNOLOGY

 Organization address address: TECHNION CITY - SENATE BUILDING
city: HAIFA
postcode: 32000

contact info
Titolo: Mr.
Nome: Mark
Cognome: Davison
Email: send email
Telefono: +972 4 829 3097
Fax: +972 4 823 2958

IL (HAIFA) hostInstitution 1˙743˙676.00

Mappa


 Word cloud

Esplora la "nuvola delle parole (Word Cloud) per avere un'idea di massima del progetto.

theoretical    mathematical    propositional    proof    solving    probabilistically    sat    limits    quest    progress    questions    checkable    algorithms    complexity    computation    computer    proofs    pcps    science    expand    practical   

 Obiettivo del progetto (Objective)

'The project described in this proposal studies formal proofs and their interaction with computation. The study of propositional proofs is connected to a spectrum of problems in our field, starting with the meta-mathematical quest to explain our failure to understand computation and make progress on the basic questions haunting our field (such as P vs. NP), and ending with the industry-driven quest for better algorithms for solving instances of the satisfiability problem. In a seemingly different direction, the recent introduction of magical probabilistically checkable proofs (PCPs) has opened new horizons in computer science, ranging from a deeper understanding of approximation algorithms and their limits to the construction of super-efficient protocols for the verification of proofs and computations. We suggest to study proofs and computation with three main objectives. First, to construct better SAT solvers via a better understanding of propositional proof systems. Second, to expand the range of applications of PCPs and transform them from the purely theoretical objects that they currently are to practical and accessible formats for use in all settings where proofs are encountered. Third, to expand our theoretical understanding of the intrinsic limits of proofs, with an eye towards explaining why we are unable to make significant progress on central questions in computational complexity. We believe this project can bridge across different regions of computer science such as SAT solving and proof complexity, theory and practice, propositional proofs and probabilistically checkable ones. And its expected impact will start on the theoretical mathematical level that forms the foundation of computer science and percolate to more practical areas of our field.'

Altri progetti dello stesso programma (FP7-IDEAS-ERC)

ANGIOMIRS (2009)

microRNAs in vascular homeostasis

Read More  

EDECS (2012)

Exploring Dark Energy through Cosmic Structures: Observational Consequences of Dark Energy Clustering

Read More  

RURLAND (2014)

Rural Landscape in north-eastern Roman Gaul

Read More