On relative OR-complexity of Boolean matrices and their complements
Computational Complexity
2014-07-18 v1
Abstract
We construct explicit Boolean square matrices whose rectifier complexity (OR-complexity) differs significantly from the complexity of their complement matrices.
Cite
@article{arxiv.1407.4626,
title = {On relative OR-complexity of Boolean matrices and their complements},
author = {Igor S. Sergeev},
journal= {arXiv preprint arXiv:1407.4626},
year = {2014}
}
Comments
3 pages, published in Russian in Proc. 17-th Int. Conf. on Problems of Theoretical Cybernetics (Kazan, 16-20 June 2014), 262-264