Challenging Computational Infeasibility: PCP and Boolean functions

Project Information

PCPABF

Grant agreement ID: 835152

DOI

10.3030/835152

Project closed

EC signature date 10 April 2019

Start date 1 October 2019

End date 30 September 2025

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 2 059 375,00

EU contribution

€ 2 059 375,00

Coordinated by

TEL AVIV UNIVERSITY
Israel

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Other (6)

Deterministic Hardness of Approximation of Unique-SVP and GapSVP in l_p norms for p>2

Author(s): Yahli Hecht, Muli Safra
Published in: 2025
Publisher: CoRR
DOI: 10.48550/arxiv.2510.16991

Heterogeneity and Superspreading Effect on Herd Immunity

Author(s): Shmuel Safra, Yaron Oz, Ittai Rubinstein
Published in: 2020
Publisher: MedRXiv
DOI: 10.1101/2020.09.06.20189290

Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality

Author(s): Esty Kelman, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra
Published in: Electronic Colloquium on Computational Complexity, Issue 9, 2020, ISSN 1433-8092
Publisher: Weizmann Institute of Science

Pandemic Spread in Communities via Random Graphs

Author(s): Dor Minzer, Yaron Oz, Muli Safra, Lior Wainstain
Published in: 2021
Publisher: ArXiv

Superspreaders and High Variance Infectious Diseases

Author(s): Shmuel Safra, Yaron Oz, Ittai Rubinstein
Published in: 2020
Publisher: MedRXiv

On the Shortest Lattice Vector vs. the Shortest Basis

Author(s): Eisenberg, Yael; Rot, Itamar; Safra, Muli
Published in: Issue 1, 2023
Publisher: CoRR
DOI: 10.48550/arxiv.2305.19777

Conference proceedings (3)

Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality

Author(s): Esty Kelman, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra
Published in: 12th Innovations in Theoretical Computer Science Conference (ITCS 2021), 2021, Page(s) 26:1-26:17
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.itcs.2021.26

NP-Hardness of Almost Coloring Almost 3-Colorable Graphs

Author(s): Hecht, Yahli; Minzer, Dor; Safra, Muli
Published in: Issue 1, 2023
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.approx/random.2023.51

Towards a Proof of the Fourier–Entropy Conjecture?

Author(s): Esty Kelman; Guy Kindler; Noam Lifshitz; Dor Minzer; Muli Safra
Published in: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, Page(s) 247-258
Publisher: IEEE Computer Society
DOI: 10.1109/focs46700.2020.00032

Peer reviewed articles (3)

Multivariate generating functions for information spread on multi-type random graphs

Author(s): Oz, Yaron; Rubinstein, Ittai; Safra, Muli
Published in: Journal of Statistical Mechanics: Theory and Experiment, Issue 3, 2022, Page(s) 033501, ISSN 1742-5468
Publisher: Institute of Physics
DOI: 10.1088/1742-5468/ac57b8

Towards a Proof of the Fourier-Entropy Conjecture?

Author(s): Esty Kelman, Guy Kindler, Noam Lifshitz, Dor Minzer, Muli Safra
Published in: Geometric and Functional Analysis, Issue 30/4, 2020, Page(s) 1097-1138, ISSN 1016-443X
Publisher: Birkhauser Verlag
DOI: 10.1007/s00039-020-00544-2

Small-Set Expansion in the Johnson Graph

Author(s): Subhash Khot, Dor Minzer, Dana Moshkovitz, Muli Safra
Published in: Theory of Computing, Issue 21, 2025, Page(s) 1-43, ISSN 1557-2862
Publisher: Theory of Computing Exchange
DOI: 10.4086/toc.2025.v021a002

Book chapters (1)

Mathematics of computation through the lens of linear equations and lattices

Author(s): Muli (Shmuel) Safra
Published in: International Congress of Mathematicians, 2024, Page(s) 4914-4969
Publisher: EMS Press
DOI: 10.4171/icm2022/178