On a family of Boolean matrices

MaRDI QIDQ581405zbMATH OpenFDO

Authors Alexander E. Andreev

Publication date 1986

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

zbMATH Keywords

Boolean matricesminimum complexityswitching networks

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Review text

Translation from Vestn. Mosk. Univ., Ser. I 1986, No.2, 97-100 (Russian) (1986; Zbl 0604.05008).

Recommendations

• scientific article; zbMATH DE number 3974967
• scientific article; zbMATH DE number 6412861
• scientific article; zbMATH DE number 3387244
• On circulant Boolean matrices
• scientific article; zbMATH DE number 123378
• scientific article; zbMATH DE number 1561030
• scientific article; zbMATH DE number 4189927
• MATRIX REPRESENTATIONS OF BOOLEAN FUNCTIONS AND THEIR APPLICATION
• scientific article; zbMATH DE number 3952969
• On Konieczny's conjecture of Boolean matrices

Cited in

(6)

• Representing \((0,1)\)-matrices by Boolean circuits
• scientific article; zbMATH DE number 5159025 (Why is no real title available?)
• scientific article; zbMATH DE number 6962138 (Why is no real title available?)
• scientific article; zbMATH DE number 6412861 (Why is no real title available?)
• On a small class of Boolean sums
• Lower bounds for additive complexity of linear operators and bilinear algorithms for matrix and polynomial multiplication over GF(2)

This page was built for publication: On a family of Boolean matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q581405)