( en | de | ru )

 

Disambiguation of "Williams, R. Ryan"

Author of the publication

copydeleteadd this publication to your clipboard
On Super Strong ETH.

, and . SAT, volume 11628 of Lecture Notes in Computer Science, page 406-423. Springer, (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.

Judith Ryan

Aisling Ryan

John Ryan

Lawrence John Ryan

Chinhong Ryang

 

Other publications of authors with the same name

Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP., and . STOC, page 890-901. ACM, (2018)Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions., , and . SODA, page 637-649. SIAM, (2020)Tight Hardness for Shortest Cycles and Paths in Sparse Graphs., , and . SODA, page 1236-1252. SIAM, (2018)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)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)Complexity Lower Bounds from Algorithm Design.. LICS, page 1-3. IEEE, (2021)Towards Stronger Depth Lower Bounds., and . ITCS, volume 287 of LIPIcs, page 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., 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)