Abstract
The problem of the strong regularity for square matrices over a general max–min algebra is considered. An O( n 2log n) algorithm for recognition of the strong regularity of a given n× n matrix is proposed. The algorithm works without any restrictions on the underlying max–min algebra, concerning the density, or the boundedness.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.