6 citations · 8 across the 5 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2021★ 1 cited
Smaller ACC0 Circuits for Symmetric Functions
Brynmor Chapman, Ryan Williams
What is the power of constant-depth circuits with gates, that can count modulo ? Can they efficiently compute MAJORITY and other symmetric functions? When is a const…
cs.CC2008
Applying Practice to Theory
Ryan Williams
How can complexity theory and algorithms benefit from practical advances in computing? We give a short overview of some prior work using practical computing to attack problems in c…