On computing Hilbert bases via the Elliot–MacMahon algorithm
Pasechnik, Dmitrii V.
Date of Issue2001
School of Physical and Mathematical Sciences
The ways of using the Elliot–MacMahon algorithm to compute the Hilbert base of a system of linear Diophantine equations known so far are either not efficient or can fail to terminate. We present a version of an algorithm exploiting this range of ideas, which however is reasonably efficient as well as finite.
DRNTU::Engineering::Computer science and engineering::Mathematics of computing
Theoretical computer science
© 2001 Elsevier. This is the author created version of a work that has been peer reviewed and accepted for publication by Theoretical Computer Science, Elsevier. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [http://dx.doi.org/10.1016/S0304-3975(00)00229-2].