On computing Hilbert bases via the Elliot--MacMahon algorithm

DOI10.1016/S0304-3975(00)00229-2zbMath0974.68234WikidataQ56874388 ScholiaQ56874388MaRDI QIDQ5941500

Dimitrii V. Pasechnik

Publication date: 20 August 2001

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

zbMATH Keywords

linear Diophantine equationsElliot-MacMahon algorithmHilbert basis

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (2)

Multi-break rearrangements and chromosomal evolution ⋮ Design of supervisors for linear marking specifications in labeled Petri nets

Cites Work

• AC-unification race: The system solving approach, implementation and benchmarks
• An efficient incremental algorithm for solving systems of linear diophantine equations
• The height of minimal Hilbert bases
• Linear homogeneous Diophantine equations and magic labelings of graphs
• Lectures on Polytopes
• A Geometric Buchberger Algorithm for Integer Programming
• Minimal solutions of linear diophantine systems : bounds and algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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