布尔矩阵及其补矩阵的相对或复杂性
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。