Opendata, web and dolomites

PCPABF SIGNED

Challenging Computational Infeasibility: PCP and Boolean functions

Total Cost €

0

EC-Contrib. €

0

Partnership

0

Views

0

 PCPABF project word cloud

Explore the words cloud of the PCPABF project. It provides you a very rough idea of what is the project "PCPABF" about.

won    unless    consequently    close    subsequently    community    focs    technologies    proving    seems    tech    algorithmic    shown    functions    snarks    transformed    techniques    found    pcp    proved    hard    breakthrough    efforts    computational    student    2001    classify    provoked    area    np    efficient       theorem    resolving    half    framework    cryptocurrency    refute    tools    award    expansion    feasible    public    graph    grassmann    sophisticated    khot    godel    shifted    ones    progress    light    dive    paper    zcash    computing    deep    blockchain    optimization    had    governs    infeasibility    fundamental    plays    cloud    2002    conjecture    authors    motivating    solutions    optimal    theory    solved    infeasible    stronger    boolean    approximation    postulated    algorithms    complexity    ledger    awaited    minzer    science    games    prize    pi    computer    emergence    methodology    vibrant    thriving    18    johnson    extremely    distance   

Project "PCPABF" data sheet

The following table provides information about the project.

Coordinator
TEL AVIV UNIVERSITY 

Organization address
address: RAMAT AVIV
city: TEL AVIV
postcode: 69978
website: http://www.tau.ac.il/

contact info
title: n.a.
name: n.a.
surname: n.a.
function: n.a.
email: n.a.
telephone: n.a.
fax: n.a.

 Coordinator Country Israel [IL]
 Total cost 2˙059˙375 €
 EC max contribution 2˙059˙375 € (100%)
 Programme 1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC))
 Code Call ERC-2018-ADG
 Funding Scheme ERC-ADG
 Starting year 2019
 Duration (year-month-day) from 2019-10-01   to  2024-09-30

 Partnership

Take a look of project's partnership.

# participants  country  role  EC contrib. [€] 
1    TEL AVIV UNIVERSITY IL (TEL AVIV) coordinator 2˙059˙375.00

Map

 Project objective

Computer Science, in particular, Analysis of Algorithms and Computational-Complexity theory, classify algorithmic-problems into feasible ones and those that cannot be efficiently-solved. Many fundamental problems were shown NP-hard, therefore, unless P=NP, they are infeasible. Consequently, research efforts shifted towards approximation algorithms, which find close-to-optimal solutions for NP-hard optimization problems. The PCP Theorem and its application to infeasibility of approximation establish that, unless P=NP, there are no efficient approximation algorithms for numerous classical problems; research that won the authors --the PI included-- the 2001 Godel prize. To show infeasibility of approximation of some fundamental problems, however, a stronger PCP was postulated in 2002, namely, Khot's Unique-Games Conjecture. It has transformed our understanding of optimization problems, provoked new tools in order to refute it and motivating new sophisticated techniques aimed at proving it. Recently Khot, Minzer (a student of the PI) and the PI proved a related conjecture: the 2-to-2-Games conjecture (our paper just won Best Paper award at FOCS'18). In light of that progress, recognized by the community as half the distance towards the Unique-Games conjecture, resolving the Unique-Games conjecture seems much more likely. A field that plays a crucial role in this progress is Analysis of Boolean-functions. For the recent breakthrough we had to dive deep into expansion properties of the Grassmann-graph. The insight was subsequently applied to achieve much awaited progress on fundamental properties of the Johnson-graph. With the emergence of cloud-computing, cryptocurrency, public-ledger and Blockchain technologies, the PCP methodology has found new and exciting applications. This framework governs SNARKs, which is a new, emerging technology, and the ZCASH technology on top of Blockchain. This is a thriving research area, but also an extremely vibrant High-Tech sector.

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "PCPABF" 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 "PCPABF" are provided by the European Opendata Portal: CORDIS opendata.

More projects from the same programme (H2020-EU.1.1.)

CoolNanoDrop (2019)

Self-Emulsification Route to NanoEmulsions by Cooling of Industrially Relevant Compounds

Read More  

QUAMAP (2019)

Quasiconformal Methods in Analysis and Applications

Read More  

QLite (2019)

Quantum Light Enterprise

Read More