Abstract
Let A, B, and C be three n×n matrices. We investigate the problem of verifying whether AB=C over the ring of integers and finding the correct product AB. Given that C is different from AB by at most k entries, we propose an algorithm that uses O(kn2+k2n) operations. Let α be the largest absolute value of an entry in A, B, and C. The integers involved in the computation are of O(n3α2).
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.