activity
20122023
most citedThin circulant matrices and lower bounds on the complexity of some Boolean operators

5 citations · 16 across the 14 of their papers we have counts for

collaborators
Showing 2014Show all

1 paper · 1 filter

cs.CC2014

On relative OR-complexity of Boolean matrices and their complements

Igor S. Sergeev

We construct explicit Boolean square matrices whose rectifier complexity (OR-complexity) differs significantly from the complexity of their complement matrices.