Skip to main content

Challenging Computational Infeasibility: PCP and Boolean functions

Project description

Resolving computational infeasibility and inapproximability

Mathematics of computation aims at classifying algorithmic problems according to the time and memory (space) it takes to compute them. Computer scientists have formulated ways to determine whether a specific algorithmic problem can be solved. In cases where it cannot, scientists may come up with an approximation algorithm to find close-to-optimal solutions. The unique-games conjecture was proposed two decades ago to facilitate infeasibility proofs for approximation problems whose complexity is still not established. The EU-funded PCPABF project is building on their recent paper, recognised as the halfway point in the resolution of the unique-games conjecture, to go all the way to complete the proof. Applications of the techniques turned out to be relevant for pandemic spread, in particular COVID-19 crisis.

Host institution

TEL AVIV UNIVERSITY
Net EU contribution
€ 2 059 375,00
Address
Ramat Aviv
69978 Tel Aviv
Israel

See on map

Activity type
Higher or Secondary Education Establishments
Other funding
€ 2 059 375,00

Beneficiaries (1)

TEL AVIV UNIVERSITY
Israel
Net EU contribution
€ 2 059 375,00
Other funding
€ 2 059 375,00