( en | de | ru )

 

Disambiguation of "Williams, Richard Ryan"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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

Ryan Beveridge

Lawrence John Ryan

John Ryan

 

Other publications of authors with the same name

Finding Four-Node Subgraphs in Triangle Time., , , and . SODA, page 1671-1680. SIAM, (2015)Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation.. CCC, volume 50 of LIPIcs, page 2:1-2:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Lower Bounds by Algorithm Design: A Progress Report (Invited Paper).. ICALP, volume 107 of LIPIcs, page 4:1-4:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The Polynomial Method in Circuit Complexity Applied to Algorithm Design (Invited Talk).. FSTTCS, volume 29 of LIPIcs, page 47-60. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)The Orthogonal Vectors Conjecture for Branching Programs and Formulas., and . ITCS, volume 124 of LIPIcs, page 48:1-48:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)More Applications of the Polynomial Method to Algorithm Design., , and . SODA, page 218-230. SIAM, (2015)Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity., and . SODA, page 231-241. SIAM, (2015)On the (Non) NP-Hardness of Computing Circuit Complexity., and . CCC, volume 33 of LIPIcs, page 365-380. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)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)Limits on Representing Boolean Functions by Linear Combinations of Simple Functions: Thresholds, ReLUs, and Low-Degree Polynomials.. CCC, volume 102 of LIPIcs, page 6:1-6:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)