Unique games on expanding constraint graphs are easy-Reference-Cited by-同舟云学术

Unique games on expanding constraint graphs are easy

Published:2008-05-17 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the fortieth annual ACM symposium on Theory of computing
language:
Short-container-title:

Author:

Arora Sanjeev¹,Khot Subhash A.²,Kolla Alexandra³,Steurer David¹,Tulsiani Madhur³,Vishnoi Nisheeth K.⁴

Affiliation:

1. Princeton University, Princeton, NJ, USA

2. Courant Institue of Mathematical Sciences, New York University, New York, NY, USA

3. University of California, Berkeley, Berkeley, CA, USA

4. IBM India Research Lab, Delhi, India

Publisher

ACM

Link

Reference22 articles.

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

1. Gilbert and Varshamov Meet Johnson: List-Decoding Explicit Nearly-Optimal Binary Codes;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Towards the Erdős-Gallai Cycle Decomposition Conjecture;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

4. The Biased Long Code and Hardness of Vertex Cover;On Monotonicity Testing and the 2-to-2 Games Conjecture;2022-12-05

5. Pseudo-random Sets in the Grassmann Graph Have Near-Perfect Expansion;On Monotonicity Testing and the 2-to-2 Games Conjecture;2022-12-05