Abstract
The set-intersection function gives the cardinality of the intersection of two sets. In order to obtain a lower bound for the communication complexity of this function, the rank of the corresponding characteristic function-value matrices was calculated in [1] and [2]. In this note, the rank of these matrices is determined by another method of proof, which makes use of a factorization into a product of an upper and a lower triangular matrix.
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.
