On complexity of realization of Boolean matrices with connected boundary
From MaRDI portal
Recommendations
Cited in
(12)- On the Shannon function for the generation of Boolean matrices
- Realizable problems of Boolean matrices and the relations between realizable Boolean matrices and chromatic number of graphs
- On the comparison of complexity of two ways of realization of some linear Boolean functions
- On the realisation of Boolean functions by informational graphs
- scientific article; zbMATH DE number 3877096 (Why is no real title available?)
- 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?)
- On the complexity of narrow systems of Boolean vectors
- scientific article; zbMATH DE number 6179141 (Why is no real title available?)
- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices
- scientific article; zbMATH DE number 957589 (Why is no real title available?)
This page was built for publication: On complexity of realization of Boolean matrices with connected boundary
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857008)