Author of the publication

Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates.

, , , , and . CCC, volume 169 of LIPIcs, page 15:1-15:41. 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

Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates., , , , and . CCC, volume 169 of LIPIcs, page 15:1-15:41. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates., , , , and . ACM Trans. Comput. Theory, 13 (4): 23:1-23:37 (2021)On Approximating Total Variation Distance., , , , , and . CoRR, (2022)One-Tape Turing Machine and Branching Program Lower Bounds for MCSP., , , and . STACS, volume 187 of LIPIcs, page 23:1-23:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)One-way Functions and Partial MCSP., , , , and . Electron. Colloquium Comput. Complex., (2021)One-Tape Turing Machine and Branching Program Lower Bounds for MCSP., , , and . Electron. Colloquium Comput. Complex., (2020)On Approximating Total Variation Distance., , , , , and . IJCAI, page 3479-3487. ijcai.org, (2023)One-Way Functions and a Conditional Variant of MKTP., , , , and . FSTTCS, volume 213 of LIPIcs, page 7:1-7:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Total Variation Distance Estimation Is as Easy as Probabilistic Inference., , , , , and . CoRR, (2023)Circuit Lower Bounds for MCSP from Local Pseudorandom Generators., , , and . ACM Trans. Comput. Theory, 12 (3): 21:1-21:27 (2020)