( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Towards a Proof of the 2-to-1 Games Conjecture?

, , , , и . 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.

Subhash Lakshminarayana

Boris Khots

Vivone Khotnhotha

Subhash Chandra

Subhash Pokhrel

 

Другие публикации лиц с тем же именем

NP-hardness of approximately solving linear equations over reals., и . STOC, стр. 413-420. ACM, (2011)Improved Lower Bounds on the Randomized Complexity of Graph Properties., и . ICALP, том 2076 из Lecture Notes in Computer Science, стр. 285-296. Springer, (2001)Approximation Algorithms for the Max-Min Allocation Problem., и . APPROX-RANDOM, том 4627 из Lecture Notes in Computer Science, стр. 204-217. Springer, (2007)Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness., , и . CCC, стр. 107-117. IEEE Computer Society, (2003)On the Unique Games Conjecture (Invited Survey).. CCC, стр. 99-121. IEEE Computer Society, (2010)Towards an optimal query efficient PCP?, , и . ITCS, стр. 173-186. ACM, (2013)Hardness of Finding Independent Sets in Almost 3-Colorable Graphs., , , и . FOCS, стр. 212-221. IEEE Computer Society, (2010)Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion., , и . FOCS, стр. 592-601. IEEE Computer Society, (2018)Hardness of Finding Independent Sets in Almost q-Colorable Graphs., и . FOCS, стр. 380-389. IEEE Computer Society, (2012)Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies., и . FOCS, стр. 318-328. IEEE Computer Society, (2007)