On relative OR-complexity of Boolean matrices and their complements
  We construct explicit Boolean square matrices whose rectifier complexity (OR-complexity) differs significantly from the complexity of their complement matrices. 
Igor S. Sergeev
cs.CC