On computing Hilbert bases via the Elliot--MacMahon algorithm

DOI10.1016/S0304-3975(00)00229-2MaRDI QIDQ5941500zbMATH OpenDBLPWikidataFDO

Authors Dmitrii V. Pasechnik

Publication date 20 August 2001

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(00)00229-2

zbMATH Keywords

Elliot-MacMahon algorithmHilbert basislinear Diophantine equations

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Publication:4941892
• Normaliz: Algorithms for affine monoids and rational cones
• scientific article; zbMATH DE number 1860733
• scientific article; zbMATH DE number 1405441
• Computation of Hilbert functions

Cites work

• A Geometric Buchberger Algorithm for Integer Programming
• AC-unification race: The system solving approach, implementation and benchmarks
• An efficient incremental algorithm for solving systems of linear diophantine equations
• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 1276818 (Why is no real title available?)
• scientific article; zbMATH DE number 1033560 (Why is no real title available?)
• scientific article; zbMATH DE number 835749 (Why is no real title available?)
• Lectures on Polytopes
• Linear homogeneous Diophantine equations and magic labelings of graphs
• Minimal solutions of linear diophantine systems : bounds and algorithms
• The height of minimal Hilbert bases

Cited in

(3)

• Design of supervisors for linear marking specifications in labeled Petri nets
• On the complexity of recognizing the Hilbert basis of a linear Diophantine system
• Multi-break rearrangements and chromosomal evolution

This page was built for publication: On computing Hilbert bases via the Elliot--MacMahon algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941500)