Hermite Normal Form Computation Using Modulo Determinant Arithmetic
From MaRDI portal
Publication:3026176
DOI10.1287/moor.12.1.50zbMath0624.65036OpenAlexW2166789519MaRDI QIDQ3026176
Leslie E. jun. Trotter, Ravindran Kannan, Paul D. Domich
Publication date: 1987
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.12.1.50
Related Items
On random nonsingular Hermite normal form, A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups, Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients, Computational complexity and constraint logic programming languages, Frustrated two dimensional quantum magnets, Using abstract stobjs in ACL2 to compute matrix normal forms, On lattice reduction for polynomial matrices, On the complexity of inverting integer and polynomial matrices, Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm, Computing the sign or the value of the determinant of an integer matrix, a complexity survey., Cuts from proofs: a complete and practical technique for solving linear inequalities over integers, A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x\)], Decomposing finitely generated integral monoids by elimination, An Experimental Study of Kannan’s Embedding Technique for the Search LWE Problem, Normal forms for general polynomial matrices, Storage efficient algorithm for Hermite normal form using LLL, A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x\)-lattices], A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix, Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time, Fast computation of Hermite normal forms of random integer matrices, The structure of an integral monoid and integer programming feasibility, Sieving in Function Fields, A Rigorous Subexponential Algorithm For Computation of Class Groups, On the Computation of Unit Groups and Class Groups of Totally Real Quartic Fields, CoEulerian graphs, Computing Hermite and Smith normal forms of triangular integer matrices, The constraints of the group of an integral monoid, Hermite and Smith normal form algorithms over Dedekind domains, An application of the Hermite normal form in integer programming, A primal dual integer programming algorithm, Recognizing badly presented \(Z\)-modules, Computing discrete logarithms in real quadratic congruence function fields of large genus, Computing in quotients of rings of integers
