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

Irit Dinur
, Subhash Khot
, Guy Kindler
, Dor Minzer
, Muli Safra

Department of Computer Science and Applied Mathematics

Weizmann Institute of Science

Research output: Contribution to journal › Article

Original language	English GB
Article number	198
Number of pages	33
Journal	Electronic colloquium on computational complexity ECCC ; research reports, surveys and books in computational complexity
State	Published - 14 Dec 2016

Access to Document

https://eccc.weizmann.ac.il/report/2016/198/License: Unspecified

Cite this

TY - JOUR

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

AU - Dinur, Irit

AU - Khot, Subhash

AU - Kindler, Guy

AU - Minzer, Dor

AU - Safra, Muli

PY - 2016/12/14

Y1 - 2016/12/14

M3 - مقالة

SN - 1433-8092

JO - Electronic colloquium on computational complexity ECCC ; research reports, surveys and books in computational complexity

JF - Electronic colloquium on computational complexity ECCC ; research reports, surveys and books in computational complexity

M1 - 198

ER -