5 citations · 16 across the 14 of their papers we have counts for
Showing 2013 · cs.DSShow all
2 papers · 2 filters
cs.DS2013★ 1 cited
Implementation of linear maps with circulant matrices via modulo 2 rectifier circuits of bounded depth
Igor S. Sergeev
In the present note we show that for any positive integer k an arbitrary Boolean circulant matrix can be implemented via modulo 2 rectifier circuit of depth 2k-1 and complexity O(n…
cs.DS2013★ 4 cited
A relation between additive and multiplicative complexity of Boolean functions
Igor S. Sergeev
In the present note we prove an asymptotically tight relation between additive and multiplicative complexity of Boolean functions with respect to implementation by circuits over th…