Abstract
We precisely analyse ideas of M. A. Kronrod for the efficient composition of binary relations on finite domains. It shows that the “Four Russians” algorithm for Boolean matrix multiplication behaves no different in average and worst cases, which therefore makes it less preferable for use than is often claimed.
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.
