Author of the publication

Polynomial Representations of Threshold Functions and Algorithmic Applications.

, , and . FOCS, page 467-476. IEEE Computer Society, (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. 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

Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms., and . STACS, volume 154 of LIPIcs, page 59:1-59:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Orthogonal Vectors Conjecture for Branching Programs and Formulas., and . CoRR, (2017)Polynomial Representations of Threshold Functions and Algorithmic Applications., , and . FOCS, page 467-476. IEEE Computer Society, (2016)Weak lower bounds on resource-bounded compression imply strong separations of complexity classes., , and . STOC, page 1215-1225. ACM, (2019)Beating Brute Force for Compression Problems., , and . STOC, page 659-670. ACM, (2024)Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP., and . STOC, page 890-901. ACM, (2018)Tight Hardness for Shortest Cycles and Paths in Sparse Graphs., , and . SODA, page 1236-1252. SIAM, (2018)Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions., , and . SODA, page 637-649. SIAM, (2020)A VLSI Circuit Model Accounting for Wire Delay., , and . ITCS, volume 287 of LIPIcs, page 66:1-66:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Smaller ACC0 Circuits for Symmetric Functions., and . ITCS, volume 215 of LIPIcs, page 38:1-38:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)