( en | de | ru )

 

Disambiguation of "Kindler, Guy"

Author of the publication

copydeleteadd this publication to your clipboard
Towards a Proof of the 2-to-1 Games Conjecture?

, , , , and . Electron. Colloquium Comput. Complex., (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Olga Guyot

Thomas Guyet

Irene Guy

Bodo Guyet

Karl Guyot

 

Other publications of authors with the same name

Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?., , , and . SIAM J. Comput., 37 (1): 319-357 (2007)PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability., , , , and . Comput. Complex., 20 (3): 413-504 (2011)Testing juntas., , , , and . J. Comput. Syst. Sci., 68 (4): 753-787 (2004)Approximating CVP to Within Almost-Polynomial Factors is NP-Hard., , , and . Comb., 23 (2): 205-243 (2003)Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality., , , , and . Electron. Colloquium Comput. Complex., (2020)Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors., , , , and . Electron. Colloquium Comput. Complex., (2010)Limits of Preprocessing., , , and . CCC, volume 169 of LIPIcs, page 17:1-17:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Hardness of Approximating the Closest Vector Problem with Pre-Processing., , , and . FOCS, page 216-225. IEEE Computer Society, (2005)PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability., , , , and . STOC, page 29-40. ACM, (1999)Approximating-CVP to Within Almost-Polynomial Factors is NP-Hard., , and . FOCS, page 99-111. IEEE Computer Society, (1998)