Ryan Williams

most citedLower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of

#

SAT Algorithms

2 citations · 2 across the 1 of their papers we have counts for

collaborators

2 papers

cs.CC2020★ 2 cited

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

Nikhil Vyas, Ryan Williams

We continue the program of proving circuit lower bounds via circuit satisfiability algorithms. So far, this program has yielded several concrete results, proving that functions in…

cs.CC2017

Distributed PCP Theorems for Hardness of Approximation in P

Amir Abboud, Aviad Rubinstein, Ryan Williams

We present a new distributed model of probabilistically checkable proofs (PCP). A satisfying assignment $x \in {0, 1}^{n}$ to a CNF formula $φ$ is shared between two parties, where…

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

Distributed PCP Theorems for Hardness of Approximation in P

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