Author of the publication

When Is Amplification Necessary for Composition in Randomized Query Complexity?

, , , and . APPROX-RANDOM, volume 176 of LIPIcs, page 28:1-28:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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

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)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)No sublogarithmic-time approximation scheme for bipartite vertex cover., and . Distributed Comput., 27 (6): 435-443 (2014)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)Extension Complexity of Independent Set Polytopes., , and . FOCS, page 565-572. IEEE Computer Society, (2016)Monotone circuit lower bounds from resolution., , , and . STOC, page 902-911. ACM, (2018)On the Complexity of Modulo-q Arguments and the Chevalley-Warning Theorem., , , and . CoRR, (2019)Rectangles Are Nonnegative Juntas., , , , and . STOC, page 257-266. ACM, (2015)Lower Bounds for Unambiguous Automata via Communication Complexity., , and . ICALP, volume 229 of LIPIcs, page 126:1-126:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)