On relative OR-complexity of Boolean matrices and their complements
Igor S. Sergeev
所有作者
Igor S. Sergeev
文献摘要
We construct explicit Boolean square matrices whose rectifier complexity
(OR-complexity) differs significantly from the complexity of their complement
matrices.