Abstract
We present an inversion algorithm for nonsingular n× n matrices whose entries are degree d polynomials over a field. The algorithm is deterministic and, when n is a power of two, requires O ∼( n 3 d) field operations for a generic input; the soft-O notation O ∼ indicates some missing log( nd) factors. Up to such logarithmic factors, this asymptotic complexity is of the same order as the number of distinct field elements necessary to represent the inverse 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.
