scientific article; zbMATH DE number 1254301
From MaRDI portal
Publication:4227351
zbMath0915.65033MaRDI QIDQ4227351
Arne Storjohann, George Labahn
Publication date: 23 February 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithminteger matricescomputational efficiencyHermite normal formfast computationmatrix multiplication
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (28)
Computing the torsion points of a variety defined by lacunary polynomials ⋮ Notes on \(\{a,b,c\}\)-modular matrices ⋮ On lattice point counting in \(\varDelta\)-modular polyhedra ⋮ Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix ⋮ Scaling invariants and symmetry reduction of dynamical systems ⋮ An algorithm for canonical forms of finite subsets of \(\mathbb {Z}^d\) up to affinities ⋮ The Diophantine problem for systems of algebraic equations with exponents ⋮ Enumeration and unimodular equivalence of empty delta-modular simplices ⋮ On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems ⋮ On the computation of the HNF of a module over the ring of integers of a number field ⋮ 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\)] ⋮ Representations of torsion-free arithmetic matroids ⋮ Normal forms for general polynomial matrices ⋮ A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x\)-lattices] ⋮ FPT-algorithms for some problems related to integer programming ⋮ Computation of invariants of finite abelian groups ⋮ Fast computation of Hermite normal forms of random integer matrices ⋮ Integer programming with 2-variable equations and 1-variable inequalities ⋮ Rate estimation in partially observed Markov jump processes with measurement errors ⋮ Computing Hermite and Smith normal forms of triangular integer matrices ⋮ On the recognition of \(\{a,b,c\}\)-modular matrices ⋮ FPT-algorithm for computing the width of a simplex given by a convex hull ⋮ Quasi-Affine Transformation in Higher Dimension ⋮ Efficient Craig interpolation for linear Diophantine (dis)equations and linear modular equations ⋮ On the computation of elementary divisors of integer matrices ⋮ A family of sparse polynomial systems arising in chemical reaction systems ⋮ Totally tight Chvatal-Gomory cuts
This page was built for publication:
