Pages that link to "Item:Q901933"

The following pages link to On the complexity of inverting integer and polynomial matrices (Q901933):

Displaying 13 items.

• Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation (Q540327) (← links)
• Čech type approach to computing homology of maps (Q603858) (← links)
• A \(p\)-adic algorithm for computing the inverse of integer matrices (Q1004026) (← links)
• Matrix inversion in RNC\(^ 1\) (Q1179457) (← links)
• Essentially optimal computation of the inverse of generic polynomial matrices (Q1763425) (← links)
• A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix (Q2100051) (← links)
• A deterministic algorithm for inverting a polynomial matrix (Q2254681) (← links)
• Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix (Q2402419) (← links)
• Complexity of inverting the Euler function (Q3377006) (← links)
• Computing Inverse ST in Linear Complexity (Q3506952) (← links)
• Fast finite-time observer-based sliding mode controller design for a class of uncertain nonlinear systems with input saturation (Q6496177) (← links)
• A perturbed-Alexander invariant (Q6652705) (← links)
• A new fast root-finder for black box polynomials (Q6658315) (← links)