On the complexity of narrow systems of Boolean vectors

DOI10.1515/DMA.1999.9.4.437MaRDI QIDQ4522831zbMATH OpenOpenAlexFDO

Authors A. V. Chashkin

Publication date 14 May 2001

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1999.9.4.437

zbMATH Keywords

Boolean matrixcomplexity

Mathematics Subject Classification ID

Boolean functions (06E30)

Recommendations

• On the Shannon function for the generation of Boolean matrices
• scientific article; zbMATH DE number 3974967
• On the complexity of discrete generation problems
• On the comparison of complexity of two ways of realization of some linear Boolean functions
• On complexity of realization of Boolean matrices with connected boundary

Cited in

(8)

• On the Shannon function for the generation of Boolean matrices
• On free Boolean vectors
• On the complexity of linear Boolean operators with thin matrices
• scientific article; zbMATH DE number 3974967 (Why is no real title available?)
• scientific article; zbMATH DE number 4081452 (Why is no real title available?)
• scientific article; zbMATH DE number 89638 (Why is no real title available?)
• scientific article; zbMATH DE number 741349 (Why is no real title available?)
• Complexity of fixed-size bit-vector logics

This page was built for publication: On the complexity of narrow systems of Boolean vectors

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