On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
In this paper we introduce the version 2.5 of Normaliz, a program for the computation of Hilbert bases of rational cones and the normalizations of affine monoids. It may also be used for solving diophantine linear systems of inequalities, equations and congruences. We present some of the new features of the program, as well as some recent achievements.