9 citations · 23 across the 5 of their papers we have counts for
1 paper · 1 filter
Niall Murphy, Damien Woods
We investigate the complexity of uniform OR circuits and AND circuits of polynomial-size and depth. As their name suggests, OR circuits have OR gates as their computation gates, as…