On relative OR-complexity of Boolean matrices and their complements
arXiv:1407.4626
Abstract
We construct explicit Boolean square matrices whose rectifier complexity (OR-complexity) differs significantly from the complexity of their complement matrices.
3 pages, published in Russian in Proc. 17-th Int. Conf. on Problems of Theoretical Cybernetics (Kazan, 16-20 June 2014), 262-264