Richard Ryan Williams

Publication Activity (10 Years)

Years Active: 2014-2019
Publications (10 Years): 5

Top Topics

Exhaustive Search

Boolean Formula

Top Venues

Computational Complexity Conference

Publications

Dylan M. McKay, Richard Ryan Williams
Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle. ITCS (2019)
Daniel M. Kane, Richard Ryan Williams
The Orthogonal Vectors Conjecture for Branching Programs and Formulas. ITCS (2019)
Richard Ryan Williams
Lower Bounds by Algorithm Design: A Progress Report (Invited Paper). ICALP (2018)
Richard Ryan Williams
Limits on Representing Boolean Functions by Linear Combinations of Simple Functions: Thresholds, ReLUs, and Low-Degree Polynomials. Computational Complexity Conference (2018)
Richard Ryan Williams
Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation. Computational Complexity Conference (2016)
Cody D. Murray, Richard Ryan Williams
On the (Non) NP-Hardness of Computing Circuit Complexity. Computational Complexity Conference (2015)
Rahul Santhanam, Richard Ryan Williams
Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity. SODA (2015)
Virginia Vassilevska Williams, Joshua R. Wang, Richard Ryan Williams, Huacheng Yu
Finding Four-Node Subgraphs in Triangle Time. SODA (2015)
Amir Abboud, Richard Ryan Williams, Huacheng Yu
More Applications of the Polynomial Method to Algorithm Design. SODA (2015)
Richard Ryan Williams
The Polynomial Method in Circuit Complexity Applied to Algorithm Design (Invited Talk). FSTTCS (2014)