5 citations · 16 across the 14 of their papers we have counts for
1 paper · 2 filters
Igor S. Sergeev
We construct explicit Boolean square matrices whose rectifier complexity (OR-complexity) differs significantly from the complexity of their complement matrices.