AbstractReductions to polynomial matrix multiplication are given for some classical problems involving a nonsingular input matrix over the ring of univariate polynomials with coefficients from a field. High-order lifting is used to compute the determinant, the Smith form, and a rational system solution with about the same number of field operations as required to multiply together two matrices having the same dimension and degree as the input matrix. Integrality certification is used to verify correctness of the output. The algorithms are space efficient
International audienceWe design and analyze new protocols to verify the correctness of various compu...
Three theorems are presented that establish polynomial straight-line complexity for certain operatio...
SIGLEAvailable from British Library Document Supply Centre- DSC:7673.7004(84/22) / BLDSC - British L...
AbstractReductions to polynomial matrix multiplication are given for some classical problems involvi...
A new algorithm is presented for computing the resultant of two "sufficiently generic" bivariate pol...
Linear algebra, together with polynomial arithmetic, is the foundation of computer algebra. The algo...
(eng) We study the link between the complexity of polynomial matrix multiplication and the complexit...
AbstractThe shifted number system is presented: a method for detecting and avoiding error producing ...
Complexity bounds for many problems about matrices with univariate polynomial entries have been impr...
International audienceCoppersmith has introduced a block version of Wiedemann's algorithm. The metho...
Polynomial matrices over fields and rings provide a unifying framework for many control system desig...
International audienceThis paper describes an algorithm which computes the characteristic polynomial...
Recent methods for handling matrix problems over an integral domain are investigated from a unifying...
AbstractWe consider a system of linear equations of the form A(x)X(x) = b(x), where A(x), b(x) are g...
AbstractWe present an algorithm for computing a Smith form with multipliers of a regular matrix poly...
International audienceWe design and analyze new protocols to verify the correctness of various compu...
Three theorems are presented that establish polynomial straight-line complexity for certain operatio...
SIGLEAvailable from British Library Document Supply Centre- DSC:7673.7004(84/22) / BLDSC - British L...
AbstractReductions to polynomial matrix multiplication are given for some classical problems involvi...
A new algorithm is presented for computing the resultant of two "sufficiently generic" bivariate pol...
Linear algebra, together with polynomial arithmetic, is the foundation of computer algebra. The algo...
(eng) We study the link between the complexity of polynomial matrix multiplication and the complexit...
AbstractThe shifted number system is presented: a method for detecting and avoiding error producing ...
Complexity bounds for many problems about matrices with univariate polynomial entries have been impr...
International audienceCoppersmith has introduced a block version of Wiedemann's algorithm. The metho...
Polynomial matrices over fields and rings provide a unifying framework for many control system desig...
International audienceThis paper describes an algorithm which computes the characteristic polynomial...
Recent methods for handling matrix problems over an integral domain are investigated from a unifying...
AbstractWe consider a system of linear equations of the form A(x)X(x) = b(x), where A(x), b(x) are g...
AbstractWe present an algorithm for computing a Smith form with multipliers of a regular matrix poly...
International audienceWe design and analyze new protocols to verify the correctness of various compu...
Three theorems are presented that establish polynomial straight-line complexity for certain operatio...
SIGLEAvailable from British Library Document Supply Centre- DSC:7673.7004(84/22) / BLDSC - British L...