Normaliz: A package for linear diophantine systems, polyhedra and lattices
| dc.contributor.author | Bruns, Winfried | |
| dc.date.accessioned | 2017-07-27T13:18:34Z | |
| dc.date.available | 2017-07-27T13:18:34Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | The very first version of Normaliz [5] was meant to compute normalizations of affine monoids (or semi- groups), hence the name. Over the years it has been extended to a powerful package for discrete convex geometry. We explain its main computation goals by a simple example, sketch the mathematical background and discuss the basic steps in the Normaliz primal algorithm. Some remarks on the technical aspects and the history conclude this overview. | en |
| dc.identifier.pissn | 0933-5994 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V., Fachgruppe Computeralgebra | |
| dc.relation.ispartof | Computeralgebra-Rundbrief: Vol. 59 | |
| dc.title | Normaliz: A package for linear diophantine systems, polyhedra and lattices | en |
| dc.type | Text/Journal Article | |
| gi.citation.publisherPlace | Berlin |
Dateien
Originalbündel
1 - 1 von 1