Hermite Normal Form Computation Using Modulo Determinant Arithmetic

Recommendations

scientific article; zbMATH DE number 842016
A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x]\)-lattices
scientific article; zbMATH DE number 1254301
Solving systems of linear equations over polynomials
A linear space algorithm for computing the hermite normal form

Cited in

(42)

Decomposing finitely generated integral monoids by elimination
A primal dual integer programming algorithm
Recognizing badly presented \(Z\)-modules
Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients
Computational complexity and constraint logic programming languages
On lattice reduction for polynomial matrices
Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
Using abstract stobjs in ACL2 to compute matrix normal forms
A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x]\)
Computing Hermite and Smith normal forms of triangular integer matrices
The constraints of the group of an integral monoid
Storage efficient algorithm for Hermite normal form using LLL
The structure of an integral monoid and integer programming feasibility
Frustrated two dimensional quantum magnets
Normal forms for general polynomial matrices
On random nonsingular Hermite normal form
Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
CoEulerian graphs
A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups
Computing in quotients of rings of integers
A linear space algorithm for computing the hermite normal form
On the Computation of Unit Groups and Class Groups of Totally Real Quartic Fields
An experimental study of Kannan's embedding technique for the search LWE problem
A Rigorous Subexponential Algorithm For Computation of Class Groups
scientific article; zbMATH DE number 1254301 (Why is no real title available?)
Computing discrete logarithms in real quadratic congruence function fields of large genus
Cuts from proofs: a complete and practical technique for solving linear inequalities over integers
scientific article; zbMATH DE number 2151208 (Why is no real title available?)
Hermite and Smith normal form algorithms over Dedekind domains
scientific article; zbMATH DE number 842016 (Why is no real title available?)
Sieving in Function Fields
A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x]\)-lattices
Computing Hermite Normal Form Faster via Solving System of Linear Equations
A Formal Proof of the Computation of Hermite Normal Form in a General Setting
A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix
The cyclicity rank of empty lattice simplices
Embedding integer lattices as ideals into polynomial rings
Symbolic summation of multivariate rational functions
An application of the Hermite normal form in integer programming
On the complexity of inverting integer and polynomial matrices
Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm
Fast computation of Hermite normal forms of random integer matrices

This page was built for publication: Hermite Normal Form Computation Using Modulo Determinant Arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3026176)