1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
Computing the Determinant via the Generalized Euclidean Algorithm
Janina Reuter
We present an algorithm with a natural geometric interpretation for computing the determinant of a matrix . It improves upon the current fastest determi…
On Integer Programs That Look Like Paths
Marcin Briański, Alexandra Lassota, Kristýna Pekárková +2
Solving integer programs of the form is, in general, $…
Faster Lattice Basis Computation via a Natural Generalization of the Euclidean Algorithm
Kim-Manuel Klein, Janina Reuter
The Euclidean algorithm is the oldest algorithms known to mankind. Given two integral numbers and , it computes the greatest common divisor (gcd) of and in a…
Simple Lattice Basis Computation -- The Generalization of the Euclidean Algorithm
Kim-Manuel Klein, Janina Reuter
The Euclidean algorithm is one of the oldest algorithms known to mankind. Given two integral numbers and , it computes the greatest common divisor (gcd) of and $a_…