Fast computation of Hermite normal forms of random integer matrices
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 3679047 (Why is no real title available?)
- scientific article; zbMATH DE number 1254301 (Why is no real title available?)
- A BLAS based C library for exact linear algebra on integer matrices
- A linear space algorithm for computing the hermite normal form
- An introspective algorithm for the integer determinant
- Computing Hermite and Smith normal forms of triangular integer matrices
- Exact solution of linear equations using p-adic expansions
- Hermite Normal Form Computation Using Modulo Determinant Arithmetic
- Hermite normal forms for integer matrices
- Modern computer algebra
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Sage: creating a viable free open source alternative to Magma, Maple, Mathematica, and MATLAB
- The shifted number system for fast linear algebra on integer matrices
Cited in
(10)- Computing Hermite Normal Form Faster via Solving System of Linear Equations
- scientific article; zbMATH DE number 842016 (Why is no real title available?)
- Verification protocols with sub-linear communication for polynomial matrix operations
- Storage efficient algorithm for Hermite normal form using LLL
- Bijectivity certification of 3D digitized rotations
- Natural density distribution of Hermite normal forms of integer matrices
- Zero-knowledge interactive proof systems for new lattice problems
- On random nonsingular Hermite normal form
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- scientific article; zbMATH DE number 2151208 (Why is no real title available?)
This page was built for publication: Fast computation of Hermite normal forms of random integer matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q984852)
