Author of the publication

Lower Bounds for Clique vs. Independent Set.

. FOCS, page 1066-1076. IEEE Computer Society, (2015)

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.

 

Other publications of authors with the same name

Extension Complexity of Independent Set Polytopes., , and . SIAM J. Comput., 47 (1): 241-269 (2018)Communication Complexity of Set-Disjointness for All Probabilities., and . Theory of Computing, 12 (1): 1-23 (2016)Locally checkable proofs., and . PODC, page 159-168. ACM, (2011)No sublogarithmic-time approximation scheme for bipartite vertex cover., and . Distributed Comput., 27 (6): 435-443 (2014)Linear-in-Δ lower bounds in the LOCAL model., , and . Distributed Comput., 30 (5): 325-338 (2017)The Landscape of Communication Complexity Classes., , and . ICALP, volume 55 of LIPIcs, page 86:1-86:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Adventures in Monotone Complexity and TFNP., , , and . Electron. Colloquium Comput. Complex., (2018)Extension Complexity of Independent Set Polytopes., , and . FOCS, page 565-572. IEEE Computer Society, (2016)A Composition Theorem for Conical Juntas., and . CCC, volume 50 of LIPIcs, page 5:1-5:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)A Lower Bound for Sampling Disjoint Sets., and . ACM Trans. Comput. Theory, 12 (3): 20:1-20:13 (2020)