Opendata, web and dolomites


Challenging Computational Infeasibility: PCP and Boolean functions

Total Cost €


EC-Contrib. €






 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.

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

Project "PCPABF" data sheet

The following table provides information about the project.


Organization address
address: RAMAT AVIV
city: TEL AVIV
postcode: 69978

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


Take a look of project's partnership.

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


 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 ( 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.)



Read More  


The Mass Politics of Disintegration

Read More  

DimorphicCircuits (2019)

Elucidating the development of sexually-dimorphic circuits: from molecular mechanisms to synapses and behavior

Read More