Abstract
The Boolean rank of an m×n binary matrix A is the least integer k such that A is the product of m×k and k×n binary matrices, under Boolean arithmetic. The product of the Boolean ranks of two matrices A and B is an upper bound on the Boolean rank of their Kronecker product. An example is given to show that this bound need not be tight.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
