Author of the publication

Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems.

, , , and . CCC, volume 137 of LIPIcs, page 30:1-30:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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

Weak lower bounds on resource-bounded compression imply strong separations of complexity classes., , and . STOC, page 1215-1225. ACM, (2019)Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems., , , and . CCC, volume 137 of LIPIcs, page 30:1-30:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle., and . ITCS, volume 124 of LIPIcs, page 56:1-56:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Theoretical Foundations of Team Matchmaking., and . AAMAS, page 1073-1081. ACM, (2017)