Zur Kurzanzeige

dc.contributor.authorBruns, Winfried
dc.date.accessioned2017-07-27T13:18:34Z
dc.date.available2017-07-27T13:18:34Z
dc.date.issued2016
dc.identifier.issn0933-5994
dc.description.abstractThe 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.language.isoen
dc.publisherGesellschaft für Informatik e.V., Fachgruppe Computeralgebra
dc.relation.ispartofComputeralgebra-Rundbrief: Vol. 59
dc.titleNormaliz: A package for linear diophantine systems, polyhedra and latticesen
dc.typeText/Journal Article
dc.pubPlaceBerlin


Dateien zu dieser Ressource

Thumbnail

Zur Kurzanzeige