Ryan Williams

activity

20112026

most citedA Casual Tour Around a Circuit Complexity Bound

6 citations · 9 across the 4 of their papers we have counts for

collaborators

Showing 2020Show all

1 paper · 1 filter

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…

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

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