The complexity of the realization of subdefinite matrices by gate schemes

DOI10.1007/BF01159529zbMath0641.94029MaRDI QIDQ1101066

Alexander E. Andreev

Publication date: 1987

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

Boolean matrixasymptotic complexitygate networks

Mathematics Subject Classification ID

Cites Work

• Unnamed Item

This page was built for publication: The complexity of the realization of subdefinite matrices by gate schemes