arXiv · 1303.6296
A Variant of the Gr\"obner Basis Algorithm for Computing Hilbert Bases
Abstract
Gr\"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field given as a matrix kernel.
Explore related subjects
Keep this discovery
Natalia Dück, Karl-Heinz Zimmermann. 2013-03-25. A Variant of the Gr\"obner Basis Algorithm for Computing Hilbert Bases. https://arxiv.org/abs/1303.6296
Cite the original work for its findings. Save a collection to share your selection of sources.