Return to search

Parallel Algorithms for Rational Cones and Affine Monoids / Parallele Algorithmen für rationale Kegel und affine Monoide

This thesis presents parallel algorithms for rational cones and affine monoids which pursue two main computational goals: finding the Hilbert basis, a minimal generating system of the monoid of lattice points of a cone; and counting elements degree-wise in a generating function, the Hilbert series.

Identiferoai:union.ndltd.org:uni-osnabrueck.de/oai:repositorium.ub.uni-osnabrueck.de:urn:nbn:de:gbv:700-2014042212422
Date22 April 2014
CreatorsSöger, Christof
ContributorsProf. Dr. Winfried Bruns, Prof. Dr. Michael Joswig
Source SetsUniversität Osnabrück
LanguageEnglish
Detected LanguageEnglish
Typedoc-type:doctoralThesis
Formatapplication/pdf, application/zip
RightsNamensnennung 4.0 International, http://creativecommons.org/licenses/by/4.0/

Page generated in 0.0021 seconds