Probabilistically Checkable Proofs, Agreement Tests, and High Dimensional Expanders

Project Information

PCPHDX

Grant agreement ID: 772839

DOI

10.3030/772839

Project closed

EC signature date 24 January 2018

Start date 1 February 2018

End date 31 December 2024

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 1 512 035,00

EU contribution

€ 1 512 035,00

Coordinated by

WEIZMANN INSTITUTE OF SCIENCE
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

Conference proceedings (14)

Direct Sum Testing: The General Case.

Author(s): Irit Dinur, Konstantin Golubev
Published in: APPROX-RANDOM, Issue 40, 2019, Page(s) 1-40
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.approx-random.2019.40

From Local to Robust Testing via Agreement Testing.

Author(s): Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi
Published in: 10th Innovations in Theoretical Computer Science Conference, Issue yearly, 2019, Page(s) 1-29
Publisher: Schloss Dagstuhl

New High Dimensional Expanders from Covers

Author(s): Yotam Dikstein
Published in: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, Page(s) 826-838
Publisher: ACM
DOI: 10.1145/3564246.3585183

Explicit SoS Lower Bounds from High-Dimensional Expanders

Author(s): Irit Dinur, Yuval Filmus, Prahladh Harsha, Madhur Tulsiani
Published in: ITCS, 2021
Publisher: ITCS

Swap Cosystolic Expansion

Author(s): Yotam Dikstein, Irit Dinur
Published in: STOC 2024, 2024
Publisher: ACM

Coboundary and cosystolic expansion without dependence on dimension or degree

Author(s): Dikstein, Yotam; Dinur, Irit
Published in: RANDOM APPROX 2024, Issue 3, 2024
Publisher: LIPICS

Expansion of High-Dimensional Cubical Complexes: with Application to Quantum Locally Testable Codes

Author(s): Irit Dinur, Ting-Chun Lin, Thomas Vidick
Published in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Page(s) 379-385
Publisher: IEEE
DOI: 10.1109/focs61266.2024.00031

Boolean Function Analysis on High-Dimensional Expanders

Author(s): YOTAM DIKSTEIN, IRIT DINUR, YUVAL FILMUS, PRAHLADH HARSHA
Published in: RANDOM APPROX, Issue YEARLY, 2018, Page(s) 1-20
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.approx-random.2018.38

Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]

Author(s): Irit Dinur, Yuval Filmus, Prahladh Harsha
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Page(s) 2124-2133, ISBN 978-1-61197-548-2
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.128

Hardness Amplification of Optimization Problem

Author(s): Elazar Goldenberg, Karthik C. S.
Published in: ITCS 2020, Issue yearly, 2020
Publisher: Schloss Dagstuhl
DOI: 10.4230/lipics.itcs.2020.1

Agreement Testing Theorems on Layered Set Systems

Author(s): Yotam Dikstein, Irit Dinur
Published in: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), Issue Yearly, 2019, Page(s) 1495-1524, ISBN 978-1-7281-4952-3
Publisher: IEEE
DOI: 10.1109/focs.2019.00088

Every Set in P Is Strongly Testable Under a Suitable Encoding. 

Author(s): Irit Dinur, Oded Goldreich, Tom Gur
Published in: ITCS, Issue yearly, 2019, Page(s) 1-30
Publisher: Schloss Dagstuhl

Locally testable codes with constant rate, distance, and locality

Author(s): Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, Shahar Mozes
Published in: STOC 2022, 2022, Page(s) 357-374
Publisher: ACM

Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs

Author(s): Yotam Dikstein, Irit Dinur, Alexander Lubotzky
Published in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Page(s) 826-861
Publisher: IEEE
DOI: 10.1109/focs61266.2024.00058

Peer reviewed articles (4)

On the Parameterized Complexity of Approximating Dominating Set

Author(s): Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi
Published in: Journal of the ACM, Issue 66/5, 2019, Page(s) 1-38, ISSN 0004-5411
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3325116

On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic

Author(s): Karthik C. S., Pasin Manurangsi
Published in: Combinatorica, Issue 40, 2020, Page(s) 539–573, ISSN 0209-9683
Publisher: Springer Verlag
DOI: 10.1007/s00493-019-4113-1

Bipartite Unique Neighbour Expanders via Ramanujan Graphs

Author(s): Ron Asherov, Irit Dinur
Published in: Entropy, Issue 26, 2024, Page(s) 348, ISSN 1099-4300
Publisher: Multidisciplinary Digital Publishing Institute (MDPI)
DOI: 10.3390/e26040348

Boolean Function Analysis on High-Dimensional Expanders

Author(s): Yotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha
Published in: Combinatorica, Issue 44, 2024, Page(s) 563-620, ISSN 0209-9683
Publisher: Springer Verlag
DOI: 10.1007/s00493-024-00084-5

Book chapters (1)

List Decoding with Double Samplers

Author(s): Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta Shma
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Page(s) 2134-2153, ISBN 978-1-61197-548-2
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.129