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

(40)

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

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)