( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Polynomial Representations of Threshold Functions and Algorithmic Applications.

, , и . FOCS, стр. 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.

Judith Ryan

Aisling Ryan

John Ryan

Lawrence John Ryan

Chinhong Ryang

 

Другие публикации лиц с тем же именем

Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP., и . STOC, стр. 890-901. ACM, (2018)Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions., , и . SODA, стр. 637-649. SIAM, (2020)Tight Hardness for Shortest Cycles and Paths in Sparse Graphs., , и . SODA, стр. 1236-1252. SIAM, (2018)Smaller ACC0 Circuits for Symmetric Functions., и . ITCS, том 215 из LIPIcs, стр. 38:1-38:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A VLSI Circuit Model Accounting for Wire Delay., , и . ITCS, том 287 из LIPIcs, стр. 66:1-66:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Complexity Lower Bounds from Algorithm Design.. LICS, стр. 1-3. IEEE, (2021)Towards Stronger Depth Lower Bounds., и . ITCS, том 287 из LIPIcs, стр. 10:1-10:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms., и . STACS, том 154 из LIPIcs, стр. 59:1-59:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Orthogonal Vectors Conjecture for Branching Programs and Formulas., и . CoRR, (2017)Polynomial Representations of Threshold Functions and Algorithmic Applications., , и . FOCS, стр. 467-476. IEEE Computer Society, (2016)