A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation-Reference-Cited by-同舟云学术

A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation

Published:2023-06-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 55th Annual ACM Symposium on Theory of Computing
language:
Short-container-title:

Author:

Alrabiah Omar¹,Guruswami Venkatesan¹,Kothari Pravesh K.²,Manohar Peter²

Affiliation:

1. University of California at Berkeley, Berkeley, USA

2. Carnegie Mellon University, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3564246.3585143

Reference31 articles.

1. Jackson Abascal , Venkatesan Guruswami , and Pravesh K. Kothari . 2021. Strongly refuting all semi-random Boolean CSPs . In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13 , 2021 . SIAM, 454–472. Jackson Abascal, Venkatesan Guruswami, and Pravesh K. Kothari. 2021. Strongly refuting all semi-random Boolean CSPs. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021. SIAM, 454–472.

2. Proof verification and the hardness of approximation problems

3. Probabilistic checking of proofs

4. Arnab Bhattacharyya , L Sunil Chandran , and Suprovat Ghoshal . 2020 . Combinatorial Lower Bounds for 3-Query LDCs . In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). 151, 85. Arnab Bhattacharyya, L Sunil Chandran, and Suprovat Ghoshal. 2020. Combinatorial Lower Bounds for 3-Query LDCs. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). 151, 85.

5. Arnab Bhattacharyya , Sivakanth Gopi , and Avishay Tal . 2017. Lower Bounds for 2-Query LCCs over Large Alphabet . In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017 ). Arnab Bhattacharyya, Sivakanth Gopi, and Avishay Tal. 2017. Lower Bounds for 2-Query LCCs over Large Alphabet. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017).

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Constant Query Local Decoding against Deletions Is Impossible;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. Raising the roof on the threshold for Szemerédi's theorem with random differences;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023