On non-optimally expanding sets in Grassmann graphs-Reference-Cited by-同舟云学术

On non-optimally expanding sets in Grassmann graphs

Published:2018-06-20 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Dinur Irit¹,Khot Subhash²,Kindler Guy³,Minzer Dor⁴,Safra Muli⁴

Affiliation:

1. Weizmann Institute of Science, Israel

2. New York University, USA

3. Hebrew University of Jerusalem, Israel

4. Tel Aviv University, Israel

Publisher

ACM

Link

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

Reference17 articles.

1. Boaz Barak Pravesh Kothari and David Steurer. 2018. Small-Set Expansion in Shortcode Graph and the 2-to-1 Conjecture. (2018). Boaz Barak Pravesh Kothari and David Steurer. 2018. Small-Set Expansion in Shortcode Graph and the 2-to-1 Conjecture. (2018).

2. Personal communication. Personal communication.

3. Towards a proof of the 2-to-1 games conjecture?

4. Irit Dinur Subhash Khot Guy Kindler Dor Minzer and Muli Safra. 2017. Irit Dinur Subhash Khot Guy Kindler Dor Minzer and Muli Safra. 2017.

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

1. A Fibrational Tale of Operational Logical Relations: Pure, Effectful and Differential;Logical Methods in Computer Science;2024-04-04

2. Boolean Function Analysis on High-Dimensional Expanders;Combinatorica;2024-03-18

3. Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. Pseudorandom sets in Grassmann graph have near-perfect expansion;Annals of Mathematics;2023-07-01

5. The Power of Unentangled Quantum Proofs with Non-negative Amplitudes;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02