Hermite normal form computation using modulo determinant arithmetic
Mathematics of Operations Research
A first report on the A# compiler
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Algorithms for computing a Hermite reduction of a matrix with polynomial coefficients
Theoretical Computer Science
Computing Popov and Hermite forms of polynomial matrices
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Modern computer algebra
Shifted normal forms of polynomial matrices
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Rational solutions of singular linear systems
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Factorization of differential systems in characteristic p
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
On the complexity of polynomial matrix computations
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
High-order lifting and integrality certification
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Essentially optimal computation of the inverse of generic polynomial matrices
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
Computing the rank and a small nullspace basis of a polynomial matrix
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Surface parametrisation without diagonalisation
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Output-sensitive modular algorithms for polynomial matrix normal forms
Journal of Symbolic Computation
ACM Communications in Computer Algebra
Evaluation techniques for zero-dimensional primary decomposition
Journal of Symbolic Computation
On Computing the Hermite Form of a Matrix of Differential Polynomials
CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
Fraction-free row reduction of matrices of Ore polynomials
Journal of Symbolic Computation
Normal forms for general polynomial matrices
Journal of Symbolic Computation
Designing a code generator for pairing based cryptographic functions
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Computing hermite forms of polynomial matrices
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Normalization of row reduced matrices
Proceedings of the 36th international symposium on Symbolic and algebraic computation
List decoding for binary Goppa codes
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Computing valuation popov forms
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Triangular x-basis decompositions and derandomization of linear algebra algorithms over K[x]
Journal of Symbolic Computation
Optimally robust private information retrieval
Security'12 Proceedings of the 21st USENIX conference on Security symposium
On simultaneous row and column reduction of higher-order linear differential systems
Journal of Symbolic Computation
| Hi-index | 0.01 |
A simple algorithm for lattice reduction of polynomial matrices is described and analysed. The algorithm is adapted and applied to various tasks, including rank profile and determinant computation, transformation to Hermite and Popov canonical form, polynomial linear system solving and short vector computation.