文章基本信息
- 标题：Towards a Proof of the 2-to-1 Games Conjecture?
- 本地全文：下载
- 作者：Irit Dinur ; Subhash Khot ; Guy Kindler 等
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2016
- 卷号：2016
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：We propose a combinatorial hypothesis regarding a subspace vs. subspace agreement test, and prove that if correct it leads to a proof of the 2-to-1 Games Conjecture, albeit with imperfect completeness.
