From Circuit Complexity to Faster All-Pairs Shortest Paths

by Williams, R Ryan
Published 2022

Complexity Lower Bounds from Algorithm Design

by Williams, R Ryan
Published 2022

Faster deterministic and Las vegas algorithms for offline approximate nearest neighbors in high dimensions

by Alman, Joshua, Williams, R Ryan
Published 2021

Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms

by Vyas, Nikhil, Williams, R. Ryan
Published 2021

Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky

by Chan, Timothy M, Williams, R Ryan
Published 2022

Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP

by Murray, Cody (Cody Daniel), Williams, R Ryan
Published 2021

Hardness Magnification for all Sparse NP Languages

by Chen, Lijie, Jin, Ce, Williams, R Ryan
Published 2021

Constructive Separations and Their Consequences

by Chen, Lijie, Jin, Ce, Santhanam, Rahul, Williams, R Ryan
Published 2022

Weak Lower Bounds on Resource-Bounded Compression Imply Strong Separations of Complexity Classes

by McKay, Dylan M., Murray, Cody D., Williams, R. Ryan
Published 2021