8 citations · 11 across the 3 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.CC2018★ 8 cited
Effective Divergence Analysis for Linear Recurrence Sequences
Shaull Almagor, Brynmor Chapman, Mehran Hosseini +2
We study the growth behaviour of rational linear recurrence sequences. We show that for low-order sequences, divergence is decidable in polynomial time. We also exhibit a polynomia…